./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_pso.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_pso.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 d10051af7e286b982df89e670765963a7af7eb7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:10,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:10,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:10,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:10,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:10,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:10,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:10,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:10,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:10,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:10,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:10,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:10,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:10,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:10,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:10,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:10,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:10,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:10,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:10,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:10,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:10,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:10,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:10,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:10,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:10,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:10,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:10,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:10,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:10,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:10,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:10,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:10,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:10,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:10,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:10,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:10,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:10,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:10,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:10,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:10,267 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:10,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:10,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:10,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:10,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:10,285 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:10,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:10,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:10,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:10,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:10,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:10,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:10,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:10,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:10,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:10,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:10,288 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:10,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:10,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:10,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:10,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:10,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:10,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:10,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:10,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:10,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:10,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:10,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:10,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:10,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:10,292 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 -> d10051af7e286b982df89e670765963a7af7eb7c [2019-11-28 18:22:10,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:10,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:10,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:10,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:10,614 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:10,615 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-11-28 18:22:10,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d69cfb77/5b06867fb7a342bca2460faea9d4249f/FLAGed61ddcde [2019-11-28 18:22:11,245 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:11,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-11-28 18:22:11,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d69cfb77/5b06867fb7a342bca2460faea9d4249f/FLAGed61ddcde [2019-11-28 18:22:11,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d69cfb77/5b06867fb7a342bca2460faea9d4249f [2019-11-28 18:22:11,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:11,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:11,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:11,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:11,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:11,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec85d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11, skipping insertion in model container [2019-11-28 18:22:11,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:11,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:12,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:12,175 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:12,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:12,337 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:12,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:12 WrapperNode [2019-11-28 18:22:12,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:12,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:12,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:12,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:12,349 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:12" (1/1) ... [2019-11-28 18:22:12,382 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:12" (1/1) ... [2019-11-28 18:22:12,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:12,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:12,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:12,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:12,426 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:12" (1/1) ... [2019-11-28 18:22:12,426 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:12" (1/1) ... [2019-11-28 18:22:12,430 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:12" (1/1) ... [2019-11-28 18:22:12,431 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:12" (1/1) ... [2019-11-28 18:22:12,441 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:12" (1/1) ... [2019-11-28 18:22:12,445 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:12" (1/1) ... [2019-11-28 18:22:12,451 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:12" (1/1) ... [2019-11-28 18:22:12,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:12,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:12,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:12,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:12,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:12" (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:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:12,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:12,520 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:13,223 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:13,224 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:13,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:13 BoogieIcfgContainer [2019-11-28 18:22:13,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:13,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:13,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:13,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:13,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:11" (1/3) ... [2019-11-28 18:22:13,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd466af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:13, skipping insertion in model container [2019-11-28 18:22:13,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:12" (2/3) ... [2019-11-28 18:22:13,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd466af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:13, skipping insertion in model container [2019-11-28 18:22:13,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:13" (3/3) ... [2019-11-28 18:22:13,235 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.oepc.i [2019-11-28 18:22:13,246 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:13,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:13,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:13,256 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:13,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,326 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:13,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:13,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:13,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:13,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:13,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:13,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:13,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:13,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:13,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:13,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:13,397 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-11-28 18:22:13,399 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:13,482 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:13,482 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:13,499 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:13,523 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:13,570 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:13,570 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:13,580 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:13,595 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:13,596 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:17,839 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:22:17,994 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:22:18,043 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-11-28 18:22:18,044 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-11-28 18:22:18,048 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-11-28 18:22:18,474 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-11-28 18:22:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-11-28 18:22:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:18,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:18,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:18,486 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:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-11-28 18:22:18,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:18,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313390960] [2019-11-28 18:22:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:18,916 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,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313390960] [2019-11-28 18:22:18,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:18,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572615298] [2019-11-28 18:22:18,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:18,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:18,954 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-11-28 18:22:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:19,201 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-11-28 18:22:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:19,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:19,314 INFO L225 Difference]: With dead ends: 5990 [2019-11-28 18:22:19,314 INFO L226 Difference]: Without dead ends: 5642 [2019-11-28 18:22:19,319 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:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-11-28 18:22:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-11-28 18:22:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-11-28 18:22:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-11-28 18:22:19,668 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-11-28 18:22:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:19,668 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-11-28 18:22:19,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-11-28 18:22:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:19,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:19,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:19,673 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:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-11-28 18:22:19,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:19,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114936379] [2019-11-28 18:22:19,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:19,796 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,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114936379] [2019-11-28 18:22:19,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:19,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:19,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815356708] [2019-11-28 18:22:19,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:19,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:19,800 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-11-28 18:22:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,087 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-11-28 18:22:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:20,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:20,155 INFO L225 Difference]: With dead ends: 8500 [2019-11-28 18:22:20,155 INFO L226 Difference]: Without dead ends: 8487 [2019-11-28 18:22:20,156 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,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-11-28 18:22:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-11-28 18:22:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-11-28 18:22:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-11-28 18:22:20,442 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-11-28 18:22:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-11-28 18:22:20,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-11-28 18:22:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:20,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:20,452 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,452 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:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-11-28 18:22:20,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:20,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807960769] [2019-11-28 18:22:20,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:20,538 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,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807960769] [2019-11-28 18:22:20,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:20,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:20,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697452844] [2019-11-28 18:22:20,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:20,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:20,541 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-11-28 18:22:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,711 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-11-28 18:22:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:20,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:20,779 INFO L225 Difference]: With dead ends: 10006 [2019-11-28 18:22:20,779 INFO L226 Difference]: Without dead ends: 10006 [2019-11-28 18:22:20,780 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:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-11-28 18:22:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-11-28 18:22:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-11-28 18:22:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-11-28 18:22:21,251 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-11-28 18:22:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,253 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-11-28 18:22:21,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-11-28 18:22:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:21,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:21,257 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:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-11-28 18:22:21,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338955368] [2019-11-28 18:22:21,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,344 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,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338955368] [2019-11-28 18:22:21,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:21,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491181388] [2019-11-28 18:22:21,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:21,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:21,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:21,348 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-11-28 18:22:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:21,544 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-11-28 18:22:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:21,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,588 INFO L225 Difference]: With dead ends: 10925 [2019-11-28 18:22:21,588 INFO L226 Difference]: Without dead ends: 10913 [2019-11-28 18:22:21,589 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:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-11-28 18:22:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-11-28 18:22:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-11-28 18:22:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-11-28 18:22:21,909 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-11-28 18:22:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,909 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-11-28 18:22:21,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-11-28 18:22:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:21,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:21,913 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:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-11-28 18:22:21,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735930364] [2019-11-28 18:22:21,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,970 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,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735930364] [2019-11-28 18:22:21,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:21,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056720366] [2019-11-28 18:22:21,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:21,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:21,972 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-11-28 18:22:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,183 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-11-28 18:22:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:22,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,222 INFO L225 Difference]: With dead ends: 11905 [2019-11-28 18:22:22,222 INFO L226 Difference]: Without dead ends: 11891 [2019-11-28 18:22:22,223 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:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-11-28 18:22:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-11-28 18:22:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-11-28 18:22:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-11-28 18:22:22,535 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-11-28 18:22:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,535 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-11-28 18:22:22,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-11-28 18:22:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:22,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,541 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:22,541 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:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-11-28 18:22:22,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109972659] [2019-11-28 18:22:22,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,663 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,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109972659] [2019-11-28 18:22:22,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:22,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74575169] [2019-11-28 18:22:22,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,669 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-11-28 18:22:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,755 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-11-28 18:22:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,806 INFO L225 Difference]: With dead ends: 16550 [2019-11-28 18:22:22,806 INFO L226 Difference]: Without dead ends: 15886 [2019-11-28 18:22:22,806 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:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-11-28 18:22:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-11-28 18:22:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-11-28 18:22:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-11-28 18:22:23,460 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-11-28 18:22:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,460 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-11-28 18:22:23,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-11-28 18:22:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:23,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,474 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:23,474 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:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-11-28 18:22:23,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054039897] [2019-11-28 18:22:23,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,538 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,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054039897] [2019-11-28 18:22:23,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928484698] [2019-11-28 18:22:23,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:23,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:23,540 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 3 states. [2019-11-28 18:22:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,621 INFO L93 Difference]: Finished difference Result 14507 states and 47200 transitions. [2019-11-28 18:22:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:23,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:22:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,654 INFO L225 Difference]: With dead ends: 14507 [2019-11-28 18:22:23,655 INFO L226 Difference]: Without dead ends: 14507 [2019-11-28 18:22:23,655 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:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2019-11-28 18:22:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 14339. [2019-11-28 18:22:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-11-28 18:22:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 46700 transitions. [2019-11-28 18:22:24,025 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 46700 transitions. Word has length 17 [2019-11-28 18:22:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,025 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 46700 transitions. [2019-11-28 18:22:24,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 46700 transitions. [2019-11-28 18:22:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:24,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,033 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:24,033 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:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1236852315, now seen corresponding path program 1 times [2019-11-28 18:22:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26759748] [2019-11-28 18:22:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,133 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,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26759748] [2019-11-28 18:22:24,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:24,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21867036] [2019-11-28 18:22:24,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:24,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:24,136 INFO L87 Difference]: Start difference. First operand 14339 states and 46700 transitions. Second operand 4 states. [2019-11-28 18:22:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,212 INFO L93 Difference]: Finished difference Result 14188 states and 46235 transitions. [2019-11-28 18:22:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:24,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:22:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,241 INFO L225 Difference]: With dead ends: 14188 [2019-11-28 18:22:24,241 INFO L226 Difference]: Without dead ends: 14084 [2019-11-28 18:22:24,242 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:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14084 states. [2019-11-28 18:22:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14084 to 14084. [2019-11-28 18:22:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-11-28 18:22:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-11-28 18:22:24,630 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 17 [2019-11-28 18:22:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,630 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-11-28 18:22:24,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-11-28 18:22:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:22:24,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,645 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:24,645 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:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-11-28 18:22:24,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145206834] [2019-11-28 18:22:24,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,717 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,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145206834] [2019-11-28 18:22:24,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:24,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796966383] [2019-11-28 18:22:24,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:24,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:24,720 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-11-28 18:22:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,739 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-11-28 18:22:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:24,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:22:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,743 INFO L225 Difference]: With dead ends: 1973 [2019-11-28 18:22:24,744 INFO L226 Difference]: Without dead ends: 1973 [2019-11-28 18:22:24,744 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:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-11-28 18:22:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-11-28 18:22:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-11-28 18:22:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-11-28 18:22:24,966 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-11-28 18:22:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,966 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-11-28 18:22:24,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-11-28 18:22:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:24,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,970 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:24,970 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:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-11-28 18:22:24,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960874578] [2019-11-28 18:22:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,026 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:25,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960874578] [2019-11-28 18:22:25,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786222293] [2019-11-28 18:22:25,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,028 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-11-28 18:22:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,236 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-11-28 18:22:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:25,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,240 INFO L225 Difference]: With dead ends: 2552 [2019-11-28 18:22:25,241 INFO L226 Difference]: Without dead ends: 2516 [2019-11-28 18:22:25,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-28 18:22:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-11-28 18:22:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-28 18:22:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-11-28 18:22:25,279 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-11-28 18:22:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,279 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-11-28 18:22:25,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-11-28 18:22:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:25,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,283 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:25,283 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:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-11-28 18:22:25,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233665263] [2019-11-28 18:22:25,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,365 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:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233665263] [2019-11-28 18:22:25,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:25,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623093490] [2019-11-28 18:22:25,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,368 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-11-28 18:22:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,541 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-11-28 18:22:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:25,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,545 INFO L225 Difference]: With dead ends: 2314 [2019-11-28 18:22:25,545 INFO L226 Difference]: Without dead ends: 2314 [2019-11-28 18:22:25,546 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:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-28 18:22:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-11-28 18:22:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-11-28 18:22:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-11-28 18:22:25,580 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-11-28 18:22:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,581 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-11-28 18:22:25,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-11-28 18:22:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:25,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,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] [2019-11-28 18:22:25,585 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:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-11-28 18:22:25,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840032726] [2019-11-28 18:22:25,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,646 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:25,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840032726] [2019-11-28 18:22:25,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242341564] [2019-11-28 18:22:25,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,648 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-11-28 18:22:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,849 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-11-28 18:22:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:25,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,854 INFO L225 Difference]: With dead ends: 2498 [2019-11-28 18:22:25,854 INFO L226 Difference]: Without dead ends: 2462 [2019-11-28 18:22:25,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-11-28 18:22:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-11-28 18:22:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-11-28 18:22:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-11-28 18:22:25,889 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-11-28 18:22:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,889 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-11-28 18:22:25,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-11-28 18:22:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:22:25,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,893 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:25,893 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:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-11-28 18:22:25,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508588474] [2019-11-28 18:22:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,949 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:25,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508588474] [2019-11-28 18:22:25,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47742659] [2019-11-28 18:22:25,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:25,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:25,950 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-11-28 18:22:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,969 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-11-28 18:22:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:25,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:22:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,971 INFO L225 Difference]: With dead ends: 966 [2019-11-28 18:22:25,971 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 18:22:25,971 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:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 18:22:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-11-28 18:22:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-28 18:22:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-11-28 18:22:25,983 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-11-28 18:22:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,983 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-11-28 18:22:25,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-11-28 18:22:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:25,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,985 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:25,985 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:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-11-28 18:22:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028105314] [2019-11-28 18:22:25,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,265 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,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028105314] [2019-11-28 18:22:26,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:22:26,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843114349] [2019-11-28 18:22:26,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:22:26,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:22:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:26,267 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 11 states. [2019-11-28 18:22:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:28,469 INFO L93 Difference]: Finished difference Result 2669 states and 5959 transitions. [2019-11-28 18:22:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:22:28,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-28 18:22:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:28,473 INFO L225 Difference]: With dead ends: 2669 [2019-11-28 18:22:28,473 INFO L226 Difference]: Without dead ends: 1496 [2019-11-28 18:22:28,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:22:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-11-28 18:22:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 747. [2019-11-28 18:22:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-28 18:22:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1700 transitions. [2019-11-28 18:22:28,486 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1700 transitions. Word has length 42 [2019-11-28 18:22:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:28,486 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1700 transitions. [2019-11-28 18:22:28,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:22:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1700 transitions. [2019-11-28 18:22:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:28,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:28,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:28,488 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:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1487589225, now seen corresponding path program 2 times [2019-11-28 18:22:28,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:28,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578066032] [2019-11-28 18:22:28,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:28,580 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:28,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578066032] [2019-11-28 18:22:28,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:28,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:28,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903645262] [2019-11-28 18:22:28,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:28,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:28,582 INFO L87 Difference]: Start difference. First operand 747 states and 1700 transitions. Second operand 4 states. [2019-11-28 18:22:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:28,599 INFO L93 Difference]: Finished difference Result 1146 states and 2637 transitions. [2019-11-28 18:22:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:28,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 18:22:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:28,600 INFO L225 Difference]: With dead ends: 1146 [2019-11-28 18:22:28,601 INFO L226 Difference]: Without dead ends: 427 [2019-11-28 18:22:28,601 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:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-28 18:22:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-11-28 18:22:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-28 18:22:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 985 transitions. [2019-11-28 18:22:28,609 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 985 transitions. Word has length 42 [2019-11-28 18:22:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:28,610 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 985 transitions. [2019-11-28 18:22:28,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 985 transitions. [2019-11-28 18:22:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:28,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:28,612 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:28,612 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:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash 988579599, now seen corresponding path program 3 times [2019-11-28 18:22:28,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:28,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979294824] [2019-11-28 18:22:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:28,904 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:28,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979294824] [2019-11-28 18:22:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:28,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:22:28,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287446720] [2019-11-28 18:22:28,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:22:28,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:22:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:22:28,910 INFO L87 Difference]: Start difference. First operand 427 states and 985 transitions. Second operand 9 states. [2019-11-28 18:22:29,339 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-11-28 18:22:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:30,071 INFO L93 Difference]: Finished difference Result 629 states and 1402 transitions. [2019-11-28 18:22:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:22:30,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-11-28 18:22:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:30,073 INFO L225 Difference]: With dead ends: 629 [2019-11-28 18:22:30,074 INFO L226 Difference]: Without dead ends: 495 [2019-11-28 18:22:30,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-11-28 18:22:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-28 18:22:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 437. [2019-11-28 18:22:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-28 18:22:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1000 transitions. [2019-11-28 18:22:30,080 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1000 transitions. Word has length 42 [2019-11-28 18:22:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:30,081 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 1000 transitions. [2019-11-28 18:22:30,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:22:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1000 transitions. [2019-11-28 18:22:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:30,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:30,083 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:30,083 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:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 4 times [2019-11-28 18:22:30,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:30,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24728396] [2019-11-28 18:22:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:30,173 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:30,173 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:30,177 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) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35| 1)) (= 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) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1637~0.offset_24|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1637~0.base_35|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35|) |v_ULTIMATE.start_main_~#t1637~0.offset_24| 0)) |v_#memory_int_17|) (= 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) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35|)) (= 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, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1637~0.offset=|v_ULTIMATE.start_main_~#t1637~0.offset_24|, ~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, ULTIMATE.start_main_~#t1637~0.base=|v_ULTIMATE.start_main_~#t1637~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_24|, ~y~0=v_~y~0_101, ~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|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_35|, ~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, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, 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, #NULL.offset, ULTIMATE.start_main_~#t1637~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1637~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1638~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1638~0.base, ~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, ~x$read_delayed_var~0.base, #NULL.base, 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:30,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| 4) |v_#length_9|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1638~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1638~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1638~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10|) |v_ULTIMATE.start_main_~#t1638~0.offset_9| 1))) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10|))) 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_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1638~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1638~0.offset] because there is no mapped edge [2019-11-28 18:22:30,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out-1382718785) (= ~x$r_buff1_thd0~0_Out-1382718785 ~x$r_buff0_thd0~0_In-1382718785) (= ~x$r_buff1_thd2~0_Out-1382718785 ~x$r_buff0_thd2~0_In-1382718785) (= ~y~0_Out-1382718785 ~__unbuffered_p1_EBX~0_Out-1382718785) (= ~y~0_Out-1382718785 1) (= ~x$r_buff0_thd1~0_In-1382718785 ~x$r_buff1_thd1~0_Out-1382718785) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785)) (= ~y~0_Out-1382718785 ~__unbuffered_p1_EAX~0_Out-1382718785)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382718785, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1382718785, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382718785} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382718785, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1382718785, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1382718785, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1382718785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1382718785, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1382718785, ~y~0=~y~0_Out-1382718785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1382718785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1382718785} 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:30,187 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:30,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-166277362 256) 0))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd1~0_In-166277362 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out-166277362| |P0Thread1of1ForFork1_#t~ite24_Out-166277362|) (not (= 0 (mod ~x$w_buff0_used~0_In-166277362 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In-166277362 256))) .cse0) .cse1 (= |P0Thread1of1ForFork1_#t~ite22_Out-166277362| |P0Thread1of1ForFork1_#t~ite23_Out-166277362|) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In-166277362 256))) .cse0) (= |P0Thread1of1ForFork1_#t~ite22_Out-166277362| 0))) (and (= |P0Thread1of1ForFork1_#t~ite22_In-166277362| |P0Thread1of1ForFork1_#t~ite22_Out-166277362|) (= |P0Thread1of1ForFork1_#t~ite23_In-166277362| |P0Thread1of1ForFork1_#t~ite23_Out-166277362|) (= ~x$r_buff1_thd1~0_In-166277362 |P0Thread1of1ForFork1_#t~ite24_Out-166277362|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-166277362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166277362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-166277362, ~weak$$choice2~0=~weak$$choice2~0_In-166277362, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-166277362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166277362, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-166277362|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-166277362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166277362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-166277362, ~weak$$choice2~0=~weak$$choice2~0_In-166277362, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-166277362|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-166277362|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-166277362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166277362} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:30,189 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:30,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1757275071 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1757275071 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1757275071| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1757275071| ~x$w_buff0_used~0_In-1757275071) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1757275071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1757275071} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1757275071, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1757275071|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1757275071} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:30,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1533138744 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1533138744 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1533138744 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1533138744 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1533138744| ~x$w_buff1_used~0_In1533138744) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1533138744| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1533138744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1533138744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1533138744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1533138744} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1533138744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1533138744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1533138744, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1533138744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1533138744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:30,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1186420047 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out1186420047 ~x$r_buff0_thd2~0_In1186420047)) (.cse0 (= (mod ~x$w_buff0_used~0_In1186420047 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1186420047 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1186420047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186420047} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1186420047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1186420047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186420047} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:30,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1525161790 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1525161790 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1525161790 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1525161790 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1525161790| ~x$r_buff1_thd2~0_In1525161790) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1525161790| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1525161790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1525161790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1525161790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525161790} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1525161790|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1525161790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1525161790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1525161790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525161790} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:30,192 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:30,192 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:30,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1255262328 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1255262328 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1255262328 |ULTIMATE.start_main_#t~ite34_Out1255262328|)) (and (or .cse1 .cse0) (= ~x~0_In1255262328 |ULTIMATE.start_main_#t~ite34_Out1255262328|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1255262328, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1255262328, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1255262328, ~x~0=~x~0_In1255262328} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1255262328, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1255262328, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1255262328, ~x~0=~x~0_In1255262328, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1255262328|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:30,193 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:30,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1337286447 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1337286447 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1337286447|)) (and (= ~x$w_buff0_used~0_In-1337286447 |ULTIMATE.start_main_#t~ite36_Out-1337286447|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1337286447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1337286447, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1337286447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:30,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In506865358 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In506865358 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In506865358 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In506865358 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out506865358|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In506865358 |ULTIMATE.start_main_#t~ite37_Out506865358|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In506865358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In506865358, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In506865358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506865358} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In506865358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In506865358, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out506865358|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In506865358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506865358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:30,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1682581254 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1682581254 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1682581254| 0)) (and (= ~x$r_buff0_thd0~0_In1682581254 |ULTIMATE.start_main_#t~ite38_Out1682581254|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1682581254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1682581254} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1682581254, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1682581254|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1682581254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:30,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1192339305 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1192339305 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1192339305 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1192339305 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1192339305| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1192339305| ~x$r_buff1_thd0~0_In1192339305) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192339305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192339305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192339305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192339305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192339305, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1192339305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192339305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192339305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192339305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:30,196 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:30,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:30 BasicIcfg [2019-11-28 18:22:30,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:30,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:30,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:30,273 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:30,273 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:13" (3/4) ... [2019-11-28 18:22:30,276 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:30,277 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) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35| 1)) (= 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) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1637~0.offset_24|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1637~0.base_35|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35|) |v_ULTIMATE.start_main_~#t1637~0.offset_24| 0)) |v_#memory_int_17|) (= 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) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35|)) (= 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, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1637~0.offset=|v_ULTIMATE.start_main_~#t1637~0.offset_24|, ~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, ULTIMATE.start_main_~#t1637~0.base=|v_ULTIMATE.start_main_~#t1637~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_24|, ~y~0=v_~y~0_101, ~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|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_35|, ~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, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, 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, #NULL.offset, ULTIMATE.start_main_~#t1637~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1637~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1638~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1638~0.base, ~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, ~x$read_delayed_var~0.base, #NULL.base, 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:30,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| 4) |v_#length_9|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1638~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1638~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1638~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10|) |v_ULTIMATE.start_main_~#t1638~0.offset_9| 1))) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10|))) 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_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1638~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1638~0.offset] because there is no mapped edge [2019-11-28 18:22:30,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out-1382718785) (= ~x$r_buff1_thd0~0_Out-1382718785 ~x$r_buff0_thd0~0_In-1382718785) (= ~x$r_buff1_thd2~0_Out-1382718785 ~x$r_buff0_thd2~0_In-1382718785) (= ~y~0_Out-1382718785 ~__unbuffered_p1_EBX~0_Out-1382718785) (= ~y~0_Out-1382718785 1) (= ~x$r_buff0_thd1~0_In-1382718785 ~x$r_buff1_thd1~0_Out-1382718785) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785)) (= ~y~0_Out-1382718785 ~__unbuffered_p1_EAX~0_Out-1382718785)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382718785, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1382718785, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382718785} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1382718785, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1382718785, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1382718785, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1382718785, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1382718785, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1382718785, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1382718785, ~y~0=~y~0_Out-1382718785, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1382718785, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1382718785} 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:30,283 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:30,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-166277362 256) 0))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd1~0_In-166277362 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out-166277362| |P0Thread1of1ForFork1_#t~ite24_Out-166277362|) (not (= 0 (mod ~x$w_buff0_used~0_In-166277362 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In-166277362 256))) .cse0) .cse1 (= |P0Thread1of1ForFork1_#t~ite22_Out-166277362| |P0Thread1of1ForFork1_#t~ite23_Out-166277362|) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In-166277362 256))) .cse0) (= |P0Thread1of1ForFork1_#t~ite22_Out-166277362| 0))) (and (= |P0Thread1of1ForFork1_#t~ite22_In-166277362| |P0Thread1of1ForFork1_#t~ite22_Out-166277362|) (= |P0Thread1of1ForFork1_#t~ite23_In-166277362| |P0Thread1of1ForFork1_#t~ite23_Out-166277362|) (= ~x$r_buff1_thd1~0_In-166277362 |P0Thread1of1ForFork1_#t~ite24_Out-166277362|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-166277362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166277362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-166277362, ~weak$$choice2~0=~weak$$choice2~0_In-166277362, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-166277362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166277362, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-166277362|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-166277362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166277362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-166277362, ~weak$$choice2~0=~weak$$choice2~0_In-166277362, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-166277362|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-166277362|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-166277362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-166277362} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:30,284 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:30,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1757275071 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1757275071 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1757275071| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1757275071| ~x$w_buff0_used~0_In-1757275071) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1757275071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1757275071} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1757275071, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1757275071|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1757275071} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:30,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1533138744 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1533138744 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1533138744 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1533138744 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1533138744| ~x$w_buff1_used~0_In1533138744) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1533138744| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1533138744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1533138744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1533138744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1533138744} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1533138744, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1533138744, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1533138744, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1533138744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1533138744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:30,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1186420047 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out1186420047 ~x$r_buff0_thd2~0_In1186420047)) (.cse0 (= (mod ~x$w_buff0_used~0_In1186420047 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out1186420047 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1186420047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186420047} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1186420047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1186420047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186420047} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:30,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1525161790 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1525161790 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1525161790 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1525161790 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1525161790| ~x$r_buff1_thd2~0_In1525161790) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1525161790| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1525161790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1525161790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1525161790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525161790} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1525161790|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1525161790, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1525161790, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1525161790, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1525161790} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:30,286 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:30,286 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:30,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1255262328 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1255262328 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1255262328 |ULTIMATE.start_main_#t~ite34_Out1255262328|)) (and (or .cse1 .cse0) (= ~x~0_In1255262328 |ULTIMATE.start_main_#t~ite34_Out1255262328|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1255262328, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1255262328, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1255262328, ~x~0=~x~0_In1255262328} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1255262328, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1255262328, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1255262328, ~x~0=~x~0_In1255262328, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1255262328|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:30,287 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:30,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1337286447 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1337286447 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1337286447|)) (and (= ~x$w_buff0_used~0_In-1337286447 |ULTIMATE.start_main_#t~ite36_Out-1337286447|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1337286447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1337286447, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1337286447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:30,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In506865358 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In506865358 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In506865358 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In506865358 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out506865358|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In506865358 |ULTIMATE.start_main_#t~ite37_Out506865358|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In506865358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In506865358, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In506865358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506865358} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In506865358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In506865358, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out506865358|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In506865358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506865358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:30,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1682581254 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1682581254 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1682581254| 0)) (and (= ~x$r_buff0_thd0~0_In1682581254 |ULTIMATE.start_main_#t~ite38_Out1682581254|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1682581254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1682581254} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1682581254, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1682581254|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1682581254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:30,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1192339305 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1192339305 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1192339305 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1192339305 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1192339305| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1192339305| ~x$r_buff1_thd0~0_In1192339305) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192339305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192339305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192339305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192339305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192339305, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1192339305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192339305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192339305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192339305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:30,289 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:30,418 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:30,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:30,421 INFO L168 Benchmark]: Toolchain (without parser) took 18910.26 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 880.8 MB). Free memory was 960.4 MB in the beginning and 1.6 GB in the end (delta: -669.7 MB). Peak memory consumption was 211.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:30,424 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:30,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:30,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.11 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:30,426 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:30,427 INFO L168 Benchmark]: RCFGBuilder took 769.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:30,429 INFO L168 Benchmark]: TraceAbstraction took 17044.58 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.3 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -572.9 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:30,429 INFO L168 Benchmark]: Witness Printer took 146.89 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:30,434 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.81 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 826.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.70 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 769.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17044.58 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 740.3 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -572.9 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. * Witness Printer took 146.89 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 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.3s, 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(&t1637, ((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(&t1638, ((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: 16.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1720 SDtfs, 1808 SDslu, 3147 SDs, 0 SdLazy, 3064 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 8825 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 69139 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...