./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer --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 38586063487d970bd2652743d9dfba74921893b7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12-07 17:49:03,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:49:03,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:49:03,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:49:03,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:49:03,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:49:03,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:49:03,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:49:03,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:49:03,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:49:03,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:49:03,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:49:03,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:49:03,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:49:03,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:49:03,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:49:03,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:49:03,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:49:03,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:49:03,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:49:03,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:49:03,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:49:03,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:49:03,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:49:03,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:49:03,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:49:03,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:49:03,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:49:03,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:49:03,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:49:03,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:49:03,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:49:03,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:49:03,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:49:03,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:49:03,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:49:03,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:49:03,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:49:03,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:49:03,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:49:03,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:49:03,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:49:03,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:49:03,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:49:03,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:49:03,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:49:03,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:49:03,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:49:03,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:49:03,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:49:03,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:49:03,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:49:03,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:49:03,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:49:03,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:49:03,266 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer 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 -> 38586063487d970bd2652743d9dfba74921893b7 [2019-12-07 17:49:03,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:49:03,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:49:03,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:49:03,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:49:03,379 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:49:03,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_power.opt.i [2019-12-07 17:49:03,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/data/e4d37c10b/210aa5885a82459bb415ab55eb393a60/FLAG370992581 [2019-12-07 17:49:03,791 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:49:03,792 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/sv-benchmarks/c/pthread-wmm/mix022_power.opt.i [2019-12-07 17:49:03,802 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/data/e4d37c10b/210aa5885a82459bb415ab55eb393a60/FLAG370992581 [2019-12-07 17:49:03,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/data/e4d37c10b/210aa5885a82459bb415ab55eb393a60 [2019-12-07 17:49:03,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:49:03,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:49:03,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:49:03,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:49:03,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:49:03,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:49:03" (1/1) ... [2019-12-07 17:49:03,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78735eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:03, skipping insertion in model container [2019-12-07 17:49:03,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:49:03" (1/1) ... [2019-12-07 17:49:03,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:49:03,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:49:04,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:49:04,089 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:49:04,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:49:04,174 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:49:04,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04 WrapperNode [2019-12-07 17:49:04,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:49:04,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:49:04,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:49:04,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:49:04,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:49:04,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:49:04,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:49:04,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:49:04,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... [2019-12-07 17:49:04,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:49:04,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:49:04,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:49:04,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:49:04,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/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-12-07 17:49:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:49:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:49:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:49:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:49:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:49:04,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:49:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:49:04,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:49:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:49:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:49:04,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:49:04,279 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:49:04,611 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:49:04,611 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:49:04,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:49:04 BoogieIcfgContainer [2019-12-07 17:49:04,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:49:04,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:49:04,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:49:04,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:49:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:49:03" (1/3) ... [2019-12-07 17:49:04,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc20f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:49:04, skipping insertion in model container [2019-12-07 17:49:04,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:49:04" (2/3) ... [2019-12-07 17:49:04,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc20f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:49:04, skipping insertion in model container [2019-12-07 17:49:04,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:49:04" (3/3) ... [2019-12-07 17:49:04,616 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-07 17:49:04,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:49:04,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:49:04,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:49:04,627 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:49:04,679 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:49:04,691 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:49:04,692 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:49:04,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:49:04,692 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:49:04,692 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:49:04,692 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:49:04,692 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:49:04,692 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:49:04,703 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:49:04,704 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:49:04,750 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:49:04,750 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:49:04,758 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:49:04,771 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:49:04,796 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:49:04,796 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:49:04,800 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:49:04,810 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:49:04,811 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:49:07,579 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:49:07,666 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 17:49:07,666 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 17:49:07,668 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 17:49:07,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:49:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:49:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:49:08,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:08,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:49:08,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 17:49:08,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489624986] [2019-12-07 17:49:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:08,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489624986] [2019-12-07 17:49:08,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:08,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:49:08,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25406918] [2019-12-07 17:49:08,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:08,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:08,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:08,158 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:49:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:08,342 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 17:49:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:08,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:49:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:08,403 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 17:49:08,403 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 17:49:08,404 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-12-07 17:49:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 17:49:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 17:49:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 17:49:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 17:49:08,676 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 17:49:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:08,676 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 17:49:08,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 17:49:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:49:08,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:08,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:08,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 17:49:08,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:08,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070625481] [2019-12-07 17:49:08,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:08,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070625481] [2019-12-07 17:49:08,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:08,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:49:08,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736700631] [2019-12-07 17:49:08,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:49:08,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:49:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:49:08,742 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 17:49:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:08,998 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-07 17:49:08,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:49:08,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:49:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:09,054 INFO L225 Difference]: With dead ends: 12178 [2019-12-07 17:49:09,054 INFO L226 Difference]: Without dead ends: 12171 [2019-12-07 17:49:09,055 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-12-07 17:49:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-07 17:49:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-07 17:49:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-07 17:49:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-07 17:49:09,329 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-07 17:49:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:09,330 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-07 17:49:09,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:49:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-07 17:49:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:49:09,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:09,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:09,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 17:49:09,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:09,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138919341] [2019-12-07 17:49:09,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:09,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138919341] [2019-12-07 17:49:09,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:09,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:49:09,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234126875] [2019-12-07 17:49:09,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:49:09,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:49:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:49:09,408 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-07 17:49:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:09,568 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-07 17:49:09,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:49:09,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:49:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:09,604 INFO L225 Difference]: With dead ends: 13366 [2019-12-07 17:49:09,604 INFO L226 Difference]: Without dead ends: 13366 [2019-12-07 17:49:09,605 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-12-07 17:49:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-07 17:49:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-07 17:49:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-07 17:49:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-07 17:49:09,834 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-07 17:49:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:09,834 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-07 17:49:09,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:49:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-07 17:49:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:49:09,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:09,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:09,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-07 17:49:09,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:09,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079399574] [2019-12-07 17:49:09,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:09,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-12-07 17:49:09,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079399574] [2019-12-07 17:49:09,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:09,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:49:09,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270042223] [2019-12-07 17:49:09,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:09,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:09,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:09,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:09,906 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-07 17:49:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:10,017 INFO L93 Difference]: Finished difference Result 20504 states and 63984 transitions. [2019-12-07 17:49:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:10,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:49:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:10,042 INFO L225 Difference]: With dead ends: 20504 [2019-12-07 17:49:10,042 INFO L226 Difference]: Without dead ends: 17860 [2019-12-07 17:49:10,043 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-12-07 17:49:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17860 states. [2019-12-07 17:49:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17860 to 17149. [2019-12-07 17:49:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17149 states. [2019-12-07 17:49:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17149 states to 17149 states and 53959 transitions. [2019-12-07 17:49:10,340 INFO L78 Accepts]: Start accepts. Automaton has 17149 states and 53959 transitions. Word has length 16 [2019-12-07 17:49:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:10,341 INFO L462 AbstractCegarLoop]: Abstraction has 17149 states and 53959 transitions. [2019-12-07 17:49:10,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17149 states and 53959 transitions. [2019-12-07 17:49:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:49:10,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:10,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:10,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-07 17:49:10,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:10,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947052201] [2019-12-07 17:49:10,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:10,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947052201] [2019-12-07 17:49:10,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:10,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:49:10,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073546660] [2019-12-07 17:49:10,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:49:10,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:49:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:49:10,391 INFO L87 Difference]: Start difference. First operand 17149 states and 53959 transitions. Second operand 4 states. [2019-12-07 17:49:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:10,415 INFO L93 Difference]: Finished difference Result 3138 states and 7963 transitions. [2019-12-07 17:49:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:49:10,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:49:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:10,417 INFO L225 Difference]: With dead ends: 3138 [2019-12-07 17:49:10,418 INFO L226 Difference]: Without dead ends: 2191 [2019-12-07 17:49:10,418 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-12-07 17:49:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-12-07 17:49:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2171. [2019-12-07 17:49:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-12-07 17:49:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 4929 transitions. [2019-12-07 17:49:10,444 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 4929 transitions. Word has length 17 [2019-12-07 17:49:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:10,444 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 4929 transitions. [2019-12-07 17:49:10,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:49:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 4929 transitions. [2019-12-07 17:49:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:49:10,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:10,446 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] [2019-12-07 17:49:10,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 17:49:10,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:10,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680076206] [2019-12-07 17:49:10,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:10,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680076206] [2019-12-07 17:49:10,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:10,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:49:10,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705999216] [2019-12-07 17:49:10,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:49:10,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:49:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:49:10,514 INFO L87 Difference]: Start difference. First operand 2171 states and 4929 transitions. Second operand 6 states. [2019-12-07 17:49:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:10,841 INFO L93 Difference]: Finished difference Result 5765 states and 12919 transitions. [2019-12-07 17:49:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:49:10,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:49:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:10,845 INFO L225 Difference]: With dead ends: 5765 [2019-12-07 17:49:10,845 INFO L226 Difference]: Without dead ends: 5730 [2019-12-07 17:49:10,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:49:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2019-12-07 17:49:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 3096. [2019-12-07 17:49:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-12-07 17:49:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 7111 transitions. [2019-12-07 17:49:10,883 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 7111 transitions. Word has length 25 [2019-12-07 17:49:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:10,883 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 7111 transitions. [2019-12-07 17:49:10,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:49:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 7111 transitions. [2019-12-07 17:49:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:49:10,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:10,885 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-12-07 17:49:10,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 17:49:10,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:10,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011620500] [2019-12-07 17:49:10,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:10,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011620500] [2019-12-07 17:49:10,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:10,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:49:10,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201619343] [2019-12-07 17:49:10,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:49:10,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:49:10,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:49:10,941 INFO L87 Difference]: Start difference. First operand 3096 states and 7111 transitions. Second operand 6 states. [2019-12-07 17:49:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:11,242 INFO L93 Difference]: Finished difference Result 5574 states and 12270 transitions. [2019-12-07 17:49:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:49:11,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 17:49:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:11,246 INFO L225 Difference]: With dead ends: 5574 [2019-12-07 17:49:11,246 INFO L226 Difference]: Without dead ends: 5545 [2019-12-07 17:49:11,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:49:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-12-07 17:49:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3034. [2019-12-07 17:49:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-07 17:49:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 6998 transitions. [2019-12-07 17:49:11,283 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 6998 transitions. Word has length 26 [2019-12-07 17:49:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:11,283 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 6998 transitions. [2019-12-07 17:49:11,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:49:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 6998 transitions. [2019-12-07 17:49:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:49:11,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:11,287 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-12-07 17:49:11,287 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 1 times [2019-12-07 17:49:11,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:11,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870243706] [2019-12-07 17:49:11,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:11,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870243706] [2019-12-07 17:49:11,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:11,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:49:11,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574614719] [2019-12-07 17:49:11,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:49:11,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:49:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:49:11,348 INFO L87 Difference]: Start difference. First operand 3034 states and 6998 transitions. Second operand 5 states. [2019-12-07 17:49:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:11,629 INFO L93 Difference]: Finished difference Result 4557 states and 10259 transitions. [2019-12-07 17:49:11,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:49:11,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:49:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:11,633 INFO L225 Difference]: With dead ends: 4557 [2019-12-07 17:49:11,633 INFO L226 Difference]: Without dead ends: 4557 [2019-12-07 17:49:11,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:49:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2019-12-07 17:49:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 3996. [2019-12-07 17:49:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2019-12-07 17:49:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 9096 transitions. [2019-12-07 17:49:11,677 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 9096 transitions. Word has length 27 [2019-12-07 17:49:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:11,677 INFO L462 AbstractCegarLoop]: Abstraction has 3996 states and 9096 transitions. [2019-12-07 17:49:11,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:49:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 9096 transitions. [2019-12-07 17:49:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:49:11,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:11,680 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-12-07 17:49:11,680 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-07 17:49:11,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:11,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407116654] [2019-12-07 17:49:11,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:11,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407116654] [2019-12-07 17:49:11,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:11,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:49:11,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338289371] [2019-12-07 17:49:11,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:49:11,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:11,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:49:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:49:11,742 INFO L87 Difference]: Start difference. First operand 3996 states and 9096 transitions. Second operand 5 states. [2019-12-07 17:49:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:11,776 INFO L93 Difference]: Finished difference Result 2427 states and 5306 transitions. [2019-12-07 17:49:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:49:11,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:49:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:11,778 INFO L225 Difference]: With dead ends: 2427 [2019-12-07 17:49:11,779 INFO L226 Difference]: Without dead ends: 2163 [2019-12-07 17:49:11,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:49:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-12-07 17:49:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1308. [2019-12-07 17:49:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-12-07 17:49:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2862 transitions. [2019-12-07 17:49:11,794 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2862 transitions. Word has length 28 [2019-12-07 17:49:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:11,794 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 2862 transitions. [2019-12-07 17:49:11,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:49:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2862 transitions. [2019-12-07 17:49:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:49:11,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:11,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:11,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-12-07 17:49:11,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:11,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471697710] [2019-12-07 17:49:11,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:11,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471697710] [2019-12-07 17:49:11,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:11,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:49:11,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121114386] [2019-12-07 17:49:11,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:11,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:11,839 INFO L87 Difference]: Start difference. First operand 1308 states and 2862 transitions. Second operand 3 states. [2019-12-07 17:49:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:11,877 INFO L93 Difference]: Finished difference Result 1701 states and 3674 transitions. [2019-12-07 17:49:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:11,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:49:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:11,879 INFO L225 Difference]: With dead ends: 1701 [2019-12-07 17:49:11,879 INFO L226 Difference]: Without dead ends: 1701 [2019-12-07 17:49:11,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-12-07 17:49:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1376. [2019-12-07 17:49:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-12-07 17:49:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3024 transitions. [2019-12-07 17:49:11,892 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3024 transitions. Word has length 51 [2019-12-07 17:49:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:11,892 INFO L462 AbstractCegarLoop]: Abstraction has 1376 states and 3024 transitions. [2019-12-07 17:49:11,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3024 transitions. [2019-12-07 17:49:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:49:11,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:11,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:11,894 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-12-07 17:49:11,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:11,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178318316] [2019-12-07 17:49:11,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:11,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178318316] [2019-12-07 17:49:11,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:11,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:11,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140795642] [2019-12-07 17:49:11,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:49:11,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:11,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:49:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:49:11,984 INFO L87 Difference]: Start difference. First operand 1376 states and 3024 transitions. Second operand 8 states. [2019-12-07 17:49:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:12,905 INFO L93 Difference]: Finished difference Result 2975 states and 6306 transitions. [2019-12-07 17:49:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:49:12,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-07 17:49:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:12,907 INFO L225 Difference]: With dead ends: 2975 [2019-12-07 17:49:12,907 INFO L226 Difference]: Without dead ends: 2975 [2019-12-07 17:49:12,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:49:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2019-12-07 17:49:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1387. [2019-12-07 17:49:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-12-07 17:49:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 3034 transitions. [2019-12-07 17:49:12,923 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 3034 transitions. Word has length 52 [2019-12-07 17:49:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:12,923 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 3034 transitions. [2019-12-07 17:49:12,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:49:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 3034 transitions. [2019-12-07 17:49:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:49:12,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:12,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:12,925 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-12-07 17:49:12,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:12,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542195223] [2019-12-07 17:49:12,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:12,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542195223] [2019-12-07 17:49:12,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:12,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:49:12,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110360920] [2019-12-07 17:49:12,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:49:12,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:49:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:49:12,996 INFO L87 Difference]: Start difference. First operand 1387 states and 3034 transitions. Second operand 7 states. [2019-12-07 17:49:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:13,608 INFO L93 Difference]: Finished difference Result 2755 states and 5763 transitions. [2019-12-07 17:49:13,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:49:13,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:49:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:13,610 INFO L225 Difference]: With dead ends: 2755 [2019-12-07 17:49:13,610 INFO L226 Difference]: Without dead ends: 2755 [2019-12-07 17:49:13,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:49:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-07 17:49:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1422. [2019-12-07 17:49:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-12-07 17:49:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3113 transitions. [2019-12-07 17:49:13,627 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3113 transitions. Word has length 52 [2019-12-07 17:49:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:13,627 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 3113 transitions. [2019-12-07 17:49:13,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:49:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3113 transitions. [2019-12-07 17:49:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:49:13,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:13,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:13,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:13,630 INFO L82 PathProgramCache]: Analyzing trace with hash 843046701, now seen corresponding path program 2 times [2019-12-07 17:49:13,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:13,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247826411] [2019-12-07 17:49:13,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:13,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247826411] [2019-12-07 17:49:13,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:13,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:49:13,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649881068] [2019-12-07 17:49:13,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:13,677 INFO L87 Difference]: Start difference. First operand 1422 states and 3113 transitions. Second operand 3 states. [2019-12-07 17:49:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:13,687 INFO L93 Difference]: Finished difference Result 1421 states and 3111 transitions. [2019-12-07 17:49:13,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:13,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:49:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:13,689 INFO L225 Difference]: With dead ends: 1421 [2019-12-07 17:49:13,689 INFO L226 Difference]: Without dead ends: 1421 [2019-12-07 17:49:13,690 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-12-07 17:49:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-07 17:49:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 998. [2019-12-07 17:49:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-07 17:49:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2217 transitions. [2019-12-07 17:49:13,704 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2217 transitions. Word has length 52 [2019-12-07 17:49:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:13,704 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2217 transitions. [2019-12-07 17:49:13,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2217 transitions. [2019-12-07 17:49:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:13,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:13,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:13,705 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1343423494, now seen corresponding path program 1 times [2019-12-07 17:49:13,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:13,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158897163] [2019-12-07 17:49:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:13,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158897163] [2019-12-07 17:49:13,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:13,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:49:13,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071186486] [2019-12-07 17:49:13,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:49:13,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:49:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:49:13,934 INFO L87 Difference]: Start difference. First operand 998 states and 2217 transitions. Second operand 14 states. [2019-12-07 17:49:17,154 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 17:49:17,355 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 17:49:17,707 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 17:49:17,962 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 17:49:22,177 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 17:49:22,455 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 17:49:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:24,320 INFO L93 Difference]: Finished difference Result 8327 states and 17669 transitions. [2019-12-07 17:49:24,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-07 17:49:24,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-12-07 17:49:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:24,329 INFO L225 Difference]: With dead ends: 8327 [2019-12-07 17:49:24,329 INFO L226 Difference]: Without dead ends: 6428 [2019-12-07 17:49:24,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8027 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3113, Invalid=15793, Unknown=0, NotChecked=0, Total=18906 [2019-12-07 17:49:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2019-12-07 17:49:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 1338. [2019-12-07 17:49:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-12-07 17:49:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 2972 transitions. [2019-12-07 17:49:24,373 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 2972 transitions. Word has length 53 [2019-12-07 17:49:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:24,374 INFO L462 AbstractCegarLoop]: Abstraction has 1338 states and 2972 transitions. [2019-12-07 17:49:24,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:49:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 2972 transitions. [2019-12-07 17:49:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:24,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:24,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:24,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -75320077, now seen corresponding path program 1 times [2019-12-07 17:49:24,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:24,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321993924] [2019-12-07 17:49:24,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:24,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321993924] [2019-12-07 17:49:24,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:24,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:49:24,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527811189] [2019-12-07 17:49:24,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:49:24,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:49:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:49:24,415 INFO L87 Difference]: Start difference. First operand 1338 states and 2972 transitions. Second operand 4 states. [2019-12-07 17:49:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:24,454 INFO L93 Difference]: Finished difference Result 1327 states and 2936 transitions. [2019-12-07 17:49:24,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:49:24,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:49:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:24,456 INFO L225 Difference]: With dead ends: 1327 [2019-12-07 17:49:24,456 INFO L226 Difference]: Without dead ends: 1327 [2019-12-07 17:49:24,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:49:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-12-07 17:49:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1233. [2019-12-07 17:49:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-07 17:49:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2721 transitions. [2019-12-07 17:49:24,467 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2721 transitions. Word has length 53 [2019-12-07 17:49:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:24,467 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2721 transitions. [2019-12-07 17:49:24,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:49:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2721 transitions. [2019-12-07 17:49:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:24,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:24,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:24,469 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1716506603, now seen corresponding path program 1 times [2019-12-07 17:49:24,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:24,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459851183] [2019-12-07 17:49:24,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:24,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459851183] [2019-12-07 17:49:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:49:24,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475335639] [2019-12-07 17:49:24,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:24,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:24,491 INFO L87 Difference]: Start difference. First operand 1233 states and 2721 transitions. Second operand 3 states. [2019-12-07 17:49:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:24,517 INFO L93 Difference]: Finished difference Result 1473 states and 3141 transitions. [2019-12-07 17:49:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:24,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 17:49:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:24,518 INFO L225 Difference]: With dead ends: 1473 [2019-12-07 17:49:24,519 INFO L226 Difference]: Without dead ends: 1453 [2019-12-07 17:49:24,519 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-12-07 17:49:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-07 17:49:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1156. [2019-12-07 17:49:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-12-07 17:49:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2512 transitions. [2019-12-07 17:49:24,529 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2512 transitions. Word has length 53 [2019-12-07 17:49:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:24,529 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 2512 transitions. [2019-12-07 17:49:24,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2512 transitions. [2019-12-07 17:49:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:24,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:24,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:24,530 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 718363752, now seen corresponding path program 2 times [2019-12-07 17:49:24,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:24,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442472259] [2019-12-07 17:49:24,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:24,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442472259] [2019-12-07 17:49:24,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:24,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:24,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101667160] [2019-12-07 17:49:24,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:49:24,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:49:24,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:49:24,623 INFO L87 Difference]: Start difference. First operand 1156 states and 2512 transitions. Second operand 9 states. [2019-12-07 17:49:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:25,690 INFO L93 Difference]: Finished difference Result 6214 states and 13055 transitions. [2019-12-07 17:49:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 17:49:25,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 17:49:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:25,694 INFO L225 Difference]: With dead ends: 6214 [2019-12-07 17:49:25,694 INFO L226 Difference]: Without dead ends: 5605 [2019-12-07 17:49:25,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 17:49:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5605 states. [2019-12-07 17:49:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5605 to 1115. [2019-12-07 17:49:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-12-07 17:49:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 2431 transitions. [2019-12-07 17:49:25,722 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 2431 transitions. Word has length 53 [2019-12-07 17:49:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:25,722 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 2431 transitions. [2019-12-07 17:49:25,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:49:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 2431 transitions. [2019-12-07 17:49:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:25,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:25,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:25,723 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1575444104, now seen corresponding path program 3 times [2019-12-07 17:49:25,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:25,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205175362] [2019-12-07 17:49:25,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:25,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205175362] [2019-12-07 17:49:25,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:25,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:25,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954864279] [2019-12-07 17:49:25,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:49:25,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:49:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:49:25,817 INFO L87 Difference]: Start difference. First operand 1115 states and 2431 transitions. Second operand 9 states. [2019-12-07 17:49:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:27,312 INFO L93 Difference]: Finished difference Result 7106 states and 14745 transitions. [2019-12-07 17:49:27,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 17:49:27,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 17:49:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:27,319 INFO L225 Difference]: With dead ends: 7106 [2019-12-07 17:49:27,320 INFO L226 Difference]: Without dead ends: 4792 [2019-12-07 17:49:27,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1559, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:49:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2019-12-07 17:49:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 1145. [2019-12-07 17:49:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-07 17:49:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2486 transitions. [2019-12-07 17:49:27,351 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2486 transitions. Word has length 53 [2019-12-07 17:49:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:27,352 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2486 transitions. [2019-12-07 17:49:27,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:49:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2486 transitions. [2019-12-07 17:49:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:27,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:27,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:27,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -487878202, now seen corresponding path program 4 times [2019-12-07 17:49:27,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:27,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155734819] [2019-12-07 17:49:27,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:27,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155734819] [2019-12-07 17:49:27,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:27,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:49:27,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394860554] [2019-12-07 17:49:27,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:49:27,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:49:27,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:49:27,385 INFO L87 Difference]: Start difference. First operand 1145 states and 2486 transitions. Second operand 3 states. [2019-12-07 17:49:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:27,391 INFO L93 Difference]: Finished difference Result 2023 states and 4362 transitions. [2019-12-07 17:49:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:49:27,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 17:49:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:27,393 INFO L225 Difference]: With dead ends: 2023 [2019-12-07 17:49:27,393 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 17:49:27,393 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-12-07 17:49:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 17:49:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2019-12-07 17:49:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 17:49:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2006 transitions. [2019-12-07 17:49:27,400 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2006 transitions. Word has length 53 [2019-12-07 17:49:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:27,400 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 2006 transitions. [2019-12-07 17:49:27,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:49:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2006 transitions. [2019-12-07 17:49:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:27,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:27,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:27,402 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 5 times [2019-12-07 17:49:27,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:27,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639740051] [2019-12-07 17:49:27,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:27,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639740051] [2019-12-07 17:49:27,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:27,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:49:27,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258608061] [2019-12-07 17:49:27,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:49:27,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:49:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:49:27,447 INFO L87 Difference]: Start difference. First operand 947 states and 2006 transitions. Second operand 7 states. [2019-12-07 17:49:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:27,556 INFO L93 Difference]: Finished difference Result 1505 states and 3099 transitions. [2019-12-07 17:49:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:49:27,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:49:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:27,558 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 17:49:27,558 INFO L226 Difference]: Without dead ends: 1056 [2019-12-07 17:49:27,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:49:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-07 17:49:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 923. [2019-12-07 17:49:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 17:49:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1956 transitions. [2019-12-07 17:49:27,565 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1956 transitions. Word has length 53 [2019-12-07 17:49:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:27,565 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1956 transitions. [2019-12-07 17:49:27,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:49:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1956 transitions. [2019-12-07 17:49:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:49:27,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:27,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:27,567 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 6 times [2019-12-07 17:49:27,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:27,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610486060] [2019-12-07 17:49:27,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:49:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:49:27,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:49:27,625 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:49:27,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t587~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t587~0.base_29| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29|) |v_ULTIMATE.start_main_~#t587~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29|) 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_29|) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_14|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_20|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_17|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:49:27,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:49:27,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:49:27,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-178467974 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-178467974 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-178467974|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-178467974| ~y$w_buff0_used~0_In-178467974) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178467974, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-178467974} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-178467974|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178467974, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-178467974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:49:27,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1802636314 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1802636314 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1802636314 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1802636314 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1802636314 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-1802636314| |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|) (= ~y$w_buff0~0_In-1802636314 |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In-1802636314| |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|) (= ~y$w_buff0~0_In-1802636314 |P1Thread1of1ForFork1_#t~ite15_Out-1802636314|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1802636314, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802636314, ~y$w_buff0~0=~y$w_buff0~0_In-1802636314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802636314, ~weak$$choice2~0=~weak$$choice2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1802636314|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802636314} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1802636314, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802636314, ~y$w_buff0~0=~y$w_buff0~0_In-1802636314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1802636314|, ~weak$$choice2~0=~weak$$choice2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1802636314|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802636314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:49:27,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1663306777 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out1663306777| ~y$w_buff1~0_In1663306777) (= |P1Thread1of1ForFork1_#t~ite17_In1663306777| |P1Thread1of1ForFork1_#t~ite17_Out1663306777|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1663306777 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1663306777 256))) (= 0 (mod ~y$w_buff0_used~0_In1663306777 256)) (and (= (mod ~y$w_buff1_used~0_In1663306777 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite17_Out1663306777| ~y$w_buff1~0_In1663306777) (= |P1Thread1of1ForFork1_#t~ite17_Out1663306777| |P1Thread1of1ForFork1_#t~ite18_Out1663306777|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663306777, ~y$w_buff1~0=~y$w_buff1~0_In1663306777, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663306777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663306777, ~weak$$choice2~0=~weak$$choice2~0_In1663306777, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1663306777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663306777} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663306777, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1663306777|, ~y$w_buff1~0=~y$w_buff1~0_In1663306777, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663306777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663306777, ~weak$$choice2~0=~weak$$choice2~0_In1663306777, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1663306777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663306777} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:49:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In34676567 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In34676567 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In34676567 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In34676567 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out34676567|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out34676567| ~y$w_buff1_used~0_In34676567)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In34676567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In34676567, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In34676567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34676567} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out34676567|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In34676567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In34676567, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In34676567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34676567} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:49:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1747316391 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1747316391 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1747316391 ~y$r_buff0_thd1~0_Out-1747316391))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1747316391)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1747316391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1747316391} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1747316391, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1747316391|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1747316391} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:49:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In499518780 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In499518780 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In499518780 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In499518780 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out499518780| ~y$r_buff1_thd1~0_In499518780)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out499518780| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In499518780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499518780, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In499518780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499518780} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In499518780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499518780, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out499518780|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In499518780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499518780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:49:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2005432937 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-2005432937| |P1Thread1of1ForFork1_#t~ite20_Out-2005432937|) (= |P1Thread1of1ForFork1_#t~ite21_Out-2005432937| ~y$w_buff0_used~0_In-2005432937) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2005432937 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2005432937 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-2005432937 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2005432937 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2005432937| |P1Thread1of1ForFork1_#t~ite20_Out-2005432937|) (= |P1Thread1of1ForFork1_#t~ite20_Out-2005432937| ~y$w_buff0_used~0_In-2005432937) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2005432937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2005432937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2005432937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2005432937, ~weak$$choice2~0=~weak$$choice2~0_In-2005432937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2005432937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2005432937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2005432937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2005432937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2005432937, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2005432937|, ~weak$$choice2~0=~weak$$choice2~0_In-2005432937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2005432937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:49:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:49:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1441566535 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In1441566535| |P1Thread1of1ForFork1_#t~ite29_Out1441566535|) (= ~y$r_buff1_thd2~0_In1441566535 |P1Thread1of1ForFork1_#t~ite30_Out1441566535|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1441566535| |P1Thread1of1ForFork1_#t~ite29_Out1441566535|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1441566535 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1441566535 256))) (= 0 (mod ~y$w_buff0_used~0_In1441566535 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1441566535 256))))) (= ~y$r_buff1_thd2~0_In1441566535 |P1Thread1of1ForFork1_#t~ite29_Out1441566535|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1441566535, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1441566535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441566535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441566535, ~weak$$choice2~0=~weak$$choice2~0_In1441566535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441566535} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1441566535, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1441566535|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1441566535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441566535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441566535, ~weak$$choice2~0=~weak$$choice2~0_In1441566535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441566535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:49:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:49:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1559921395 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1559921395 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1559921395| ~y$w_buff1~0_In-1559921395)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1559921395| ~y~0_In-1559921395)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1559921395, ~y$w_buff1~0=~y$w_buff1~0_In-1559921395, ~y~0=~y~0_In-1559921395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1559921395} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1559921395, ~y$w_buff1~0=~y$w_buff1~0_In-1559921395, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1559921395|, ~y~0=~y~0_In-1559921395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1559921395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:49:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1876017996 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1876017996 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1876017996| ~y$w_buff0_used~0_In1876017996) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1876017996| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1876017996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1876017996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1876017996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1876017996, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1876017996|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:49:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-97686037 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-97686037 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-97686037 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-97686037 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-97686037| ~y$w_buff1_used~0_In-97686037) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-97686037| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97686037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97686037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97686037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97686037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97686037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97686037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97686037, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-97686037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97686037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:49:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-887248612 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-887248612 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-887248612|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-887248612 |P1Thread1of1ForFork1_#t~ite36_Out-887248612|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-887248612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-887248612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-887248612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-887248612, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-887248612|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-305893441 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-305893441 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-305893441 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-305893441 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-305893441| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-305893441| ~y$r_buff1_thd2~0_In-305893441) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-305893441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-305893441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-305893441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-305893441} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-305893441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-305893441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-305893441, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-305893441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-305893441} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1675493920 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1675493920 256) 0))) (or (and (= ~y~0_In-1675493920 |ULTIMATE.start_main_#t~ite40_Out-1675493920|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1675493920| ~y$w_buff1~0_In-1675493920) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1675493920, ~y~0=~y~0_In-1675493920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675493920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675493920} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1675493920|, ~y$w_buff1~0=~y$w_buff1~0_In-1675493920, ~y~0=~y~0_In-1675493920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675493920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675493920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In825504948 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In825504948 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out825504948|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In825504948 |ULTIMATE.start_main_#t~ite42_Out825504948|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In825504948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825504948} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In825504948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825504948, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out825504948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:49:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1204019294 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1204019294 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1204019294 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1204019294 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1204019294 |ULTIMATE.start_main_#t~ite43_Out-1204019294|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1204019294|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1204019294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1204019294, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1204019294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1204019294} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1204019294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1204019294, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1204019294|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1204019294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1204019294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:49:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In630964830 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In630964830 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out630964830|)) (and (= ~y$r_buff0_thd0~0_In630964830 |ULTIMATE.start_main_#t~ite44_Out630964830|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In630964830, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In630964830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In630964830, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In630964830, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out630964830|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:49:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1722743704 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1722743704 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1722743704 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1722743704 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1722743704| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1722743704| ~y$r_buff1_thd0~0_In-1722743704)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722743704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722743704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722743704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722743704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722743704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722743704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722743704, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1722743704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722743704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:49:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:49:27,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:49:27 BasicIcfg [2019-12-07 17:49:27,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:49:27,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:49:27,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:49:27,673 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:49:27,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:49:04" (3/4) ... [2019-12-07 17:49:27,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:49:27,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t587~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t587~0.base_29| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t587~0.base_29|) |v_ULTIMATE.start_main_~#t587~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29|) 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_29|) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_14|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_20|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_17|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:49:27,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:49:27,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:49:27,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-178467974 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-178467974 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-178467974|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-178467974| ~y$w_buff0_used~0_In-178467974) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178467974, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-178467974} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-178467974|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178467974, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-178467974} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:49:27,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1802636314 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1802636314 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1802636314 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1802636314 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-1802636314 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-1802636314| |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|) (= ~y$w_buff0~0_In-1802636314 |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In-1802636314| |P1Thread1of1ForFork1_#t~ite14_Out-1802636314|) (= ~y$w_buff0~0_In-1802636314 |P1Thread1of1ForFork1_#t~ite15_Out-1802636314|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1802636314, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802636314, ~y$w_buff0~0=~y$w_buff0~0_In-1802636314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802636314, ~weak$$choice2~0=~weak$$choice2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1802636314|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802636314} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1802636314, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802636314, ~y$w_buff0~0=~y$w_buff0~0_In-1802636314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1802636314|, ~weak$$choice2~0=~weak$$choice2~0_In-1802636314, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1802636314|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802636314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:49:27,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1663306777 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out1663306777| ~y$w_buff1~0_In1663306777) (= |P1Thread1of1ForFork1_#t~ite17_In1663306777| |P1Thread1of1ForFork1_#t~ite17_Out1663306777|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1663306777 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1663306777 256))) (= 0 (mod ~y$w_buff0_used~0_In1663306777 256)) (and (= (mod ~y$w_buff1_used~0_In1663306777 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite17_Out1663306777| ~y$w_buff1~0_In1663306777) (= |P1Thread1of1ForFork1_#t~ite17_Out1663306777| |P1Thread1of1ForFork1_#t~ite18_Out1663306777|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663306777, ~y$w_buff1~0=~y$w_buff1~0_In1663306777, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663306777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663306777, ~weak$$choice2~0=~weak$$choice2~0_In1663306777, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1663306777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663306777} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1663306777, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1663306777|, ~y$w_buff1~0=~y$w_buff1~0_In1663306777, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1663306777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1663306777, ~weak$$choice2~0=~weak$$choice2~0_In1663306777, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1663306777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1663306777} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:49:27,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In34676567 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In34676567 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In34676567 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In34676567 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out34676567|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out34676567| ~y$w_buff1_used~0_In34676567)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In34676567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In34676567, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In34676567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34676567} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out34676567|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In34676567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In34676567, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In34676567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In34676567} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:49:27,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1747316391 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1747316391 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1747316391 ~y$r_buff0_thd1~0_Out-1747316391))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1747316391)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1747316391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1747316391} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1747316391, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1747316391|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1747316391} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:49:27,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In499518780 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In499518780 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In499518780 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In499518780 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out499518780| ~y$r_buff1_thd1~0_In499518780)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out499518780| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In499518780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499518780, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In499518780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499518780} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In499518780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499518780, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out499518780|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In499518780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499518780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:49:27,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2005432937 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-2005432937| |P1Thread1of1ForFork1_#t~ite20_Out-2005432937|) (= |P1Thread1of1ForFork1_#t~ite21_Out-2005432937| ~y$w_buff0_used~0_In-2005432937) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2005432937 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2005432937 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-2005432937 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2005432937 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2005432937| |P1Thread1of1ForFork1_#t~ite20_Out-2005432937|) (= |P1Thread1of1ForFork1_#t~ite20_Out-2005432937| ~y$w_buff0_used~0_In-2005432937) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2005432937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2005432937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2005432937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2005432937, ~weak$$choice2~0=~weak$$choice2~0_In-2005432937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2005432937} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2005432937, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2005432937, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2005432937|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2005432937, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2005432937|, ~weak$$choice2~0=~weak$$choice2~0_In-2005432937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2005432937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:49:27,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:49:27,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1441566535 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In1441566535| |P1Thread1of1ForFork1_#t~ite29_Out1441566535|) (= ~y$r_buff1_thd2~0_In1441566535 |P1Thread1of1ForFork1_#t~ite30_Out1441566535|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1441566535| |P1Thread1of1ForFork1_#t~ite29_Out1441566535|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1441566535 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1441566535 256))) (= 0 (mod ~y$w_buff0_used~0_In1441566535 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1441566535 256))))) (= ~y$r_buff1_thd2~0_In1441566535 |P1Thread1of1ForFork1_#t~ite29_Out1441566535|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1441566535, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1441566535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441566535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441566535, ~weak$$choice2~0=~weak$$choice2~0_In1441566535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441566535} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1441566535, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1441566535|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1441566535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1441566535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441566535, ~weak$$choice2~0=~weak$$choice2~0_In1441566535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441566535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:49:27,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:49:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1559921395 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1559921395 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1559921395| ~y$w_buff1~0_In-1559921395)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1559921395| ~y~0_In-1559921395)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1559921395, ~y$w_buff1~0=~y$w_buff1~0_In-1559921395, ~y~0=~y~0_In-1559921395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1559921395} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1559921395, ~y$w_buff1~0=~y$w_buff1~0_In-1559921395, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1559921395|, ~y~0=~y~0_In-1559921395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1559921395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:49:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1876017996 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1876017996 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1876017996| ~y$w_buff0_used~0_In1876017996) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1876017996| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1876017996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1876017996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1876017996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1876017996, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1876017996|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:49:27,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-97686037 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-97686037 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-97686037 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-97686037 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-97686037| ~y$w_buff1_used~0_In-97686037) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-97686037| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97686037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97686037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97686037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97686037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97686037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97686037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97686037, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-97686037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97686037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-887248612 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-887248612 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-887248612|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-887248612 |P1Thread1of1ForFork1_#t~ite36_Out-887248612|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-887248612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-887248612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-887248612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-887248612, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-887248612|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-305893441 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-305893441 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-305893441 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-305893441 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-305893441| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-305893441| ~y$r_buff1_thd2~0_In-305893441) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-305893441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-305893441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-305893441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-305893441} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-305893441, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-305893441, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-305893441, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-305893441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-305893441} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1675493920 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1675493920 256) 0))) (or (and (= ~y~0_In-1675493920 |ULTIMATE.start_main_#t~ite40_Out-1675493920|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1675493920| ~y$w_buff1~0_In-1675493920) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1675493920, ~y~0=~y~0_In-1675493920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675493920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675493920} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1675493920|, ~y$w_buff1~0=~y$w_buff1~0_In-1675493920, ~y~0=~y~0_In-1675493920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1675493920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1675493920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:49:27,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In825504948 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In825504948 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out825504948|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In825504948 |ULTIMATE.start_main_#t~ite42_Out825504948|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In825504948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825504948} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In825504948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In825504948, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out825504948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:49:27,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1204019294 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1204019294 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1204019294 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1204019294 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1204019294 |ULTIMATE.start_main_#t~ite43_Out-1204019294|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1204019294|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1204019294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1204019294, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1204019294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1204019294} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1204019294, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1204019294, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1204019294|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1204019294, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1204019294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:49:27,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In630964830 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In630964830 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out630964830|)) (and (= ~y$r_buff0_thd0~0_In630964830 |ULTIMATE.start_main_#t~ite44_Out630964830|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In630964830, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In630964830} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In630964830, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In630964830, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out630964830|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:49:27,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1722743704 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1722743704 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1722743704 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1722743704 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1722743704| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1722743704| ~y$r_buff1_thd0~0_In-1722743704)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722743704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722743704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722743704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722743704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722743704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722743704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722743704, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1722743704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722743704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:49:27,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:49:27,728 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_55eeb095-4cde-4e07-854f-4ed7f089ecaa/bin/uautomizer/witness.graphml [2019-12-07 17:49:27,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:49:27,729 INFO L168 Benchmark]: Toolchain (without parser) took 23916.14 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 569.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 368.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,730 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:49:27,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.64 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,730 INFO L168 Benchmark]: Boogie Preprocessor took 23.82 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,731 INFO L168 Benchmark]: RCFGBuilder took 375.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,731 INFO L168 Benchmark]: TraceAbstraction took 23060.56 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -118.5 MB). Peak memory consumption was 324.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,731 INFO L168 Benchmark]: Witness Printer took 55.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:27,732 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.64 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.82 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23060.56 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -118.5 MB). Peak memory consumption was 324.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3424 SDtfs, 6813 SDslu, 9001 SDs, 0 SdLazy, 8759 SolverSat, 834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 43 SyntacticMatches, 14 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9580 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17149occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 27478 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 144823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...