./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_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_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/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 f4132361b5aa90bc19364851b40960c5bf7c2b6f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:51:21,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:51:21,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:51:21,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:51:21,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:51:21,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:51:21,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:51:21,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:51:21,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:51:21,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:51:21,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:51:21,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:51:21,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:51:21,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:51:21,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:51:21,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:51:21,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:51:21,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:51:21,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:51:21,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:51:21,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:51:21,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:51:21,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:51:21,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:51:21,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:51:21,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:51:21,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:51:21,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:51:21,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:51:21,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:51:21,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:51:21,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:51:21,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:51:21,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:51:21,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:51:21,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:51:21,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:51:21,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:51:21,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:51:21,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:51:21,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:51:21,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:51:21,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:51:21,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:51:21,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:51:21,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:51:21,261 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:51:21,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:51:21,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:51:21,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:51:21,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:51:21,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:51:21,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:51:21,264 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_3f20b52b-8c50-4254-acb7-b2be13adf937/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 -> f4132361b5aa90bc19364851b40960c5bf7c2b6f [2019-12-07 17:51:21,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:51:21,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:51:21,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:51:21,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:51:21,378 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:51:21,378 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix002_power.opt.i [2019-12-07 17:51:21,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/data/79691ab21/61ee537b4276493185da82ffbc722b89/FLAG632cba828 [2019-12-07 17:51:21,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:51:21,883 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/sv-benchmarks/c/pthread-wmm/mix002_power.opt.i [2019-12-07 17:51:21,894 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/data/79691ab21/61ee537b4276493185da82ffbc722b89/FLAG632cba828 [2019-12-07 17:51:21,904 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/data/79691ab21/61ee537b4276493185da82ffbc722b89 [2019-12-07 17:51:21,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:51:21,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:51:21,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:51:21,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:51:21,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:51:21,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:51:21" (1/1) ... [2019-12-07 17:51:21,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:21, skipping insertion in model container [2019-12-07 17:51:21,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:51:21" (1/1) ... [2019-12-07 17:51:21,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:51:21,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:51:22,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:51:22,205 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:51:22,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:51:22,293 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:51:22,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22 WrapperNode [2019-12-07 17:51:22,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:51:22,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:51:22,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:51:22,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:51:22,299 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:51:22" (1/1) ... [2019-12-07 17:51:22,313 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:51:22" (1/1) ... [2019-12-07 17:51:22,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:51:22,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:51:22,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:51:22,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:51:22,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... [2019-12-07 17:51:22,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:51:22,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:51:22,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:51:22,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:51:22,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/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:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:51:22,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:51:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:51:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:51:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:51:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:51:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:51:22,405 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:51:22,793 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:51:22,793 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:51:22,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:51:22 BoogieIcfgContainer [2019-12-07 17:51:22,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:51:22,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:51:22,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:51:22,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:51:22,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:51:21" (1/3) ... [2019-12-07 17:51:22,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e74c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:51:22, skipping insertion in model container [2019-12-07 17:51:22,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:51:22" (2/3) ... [2019-12-07 17:51:22,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e74c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:51:22, skipping insertion in model container [2019-12-07 17:51:22,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:51:22" (3/3) ... [2019-12-07 17:51:22,798 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_power.opt.i [2019-12-07 17:51:22,804 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:51:22,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:51:22,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:51:22,810 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:51:22,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,839 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,839 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,851 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,851 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:51:22,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:51:22,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:51:22,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:51:22,889 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:51:22,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:51:22,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:51:22,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:51:22,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:51:22,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:51:22,901 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 17:51:22,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 17:51:22,965 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 17:51:22,965 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:51:22,979 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:51:23,002 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 17:51:23,037 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 17:51:23,038 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:51:23,046 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:51:23,070 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 17:51:23,070 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:51:26,673 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 17:51:26,902 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 17:51:27,010 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 17:51:27,011 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 17:51:27,013 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 17:51:29,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 17:51:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 17:51:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:51:29,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:29,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:29,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 17:51:29,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:29,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990083919] [2019-12-07 17:51:29,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:29,834 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:51:29,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990083919] [2019-12-07 17:51:29,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:29,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:51:29,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563220296] [2019-12-07 17:51:29,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:29,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:29,849 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 17:51:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:30,238 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 17:51:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:30,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:51:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:30,477 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 17:51:30,477 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 17:51:30,478 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:51:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 17:51:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 17:51:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 17:51:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 17:51:31,943 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 17:51:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:31,944 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 17:51:31,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 17:51:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:51:31,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:31,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:31,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 17:51:31,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:31,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651225614] [2019-12-07 17:51:31,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:31,998 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:51:31,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651225614] [2019-12-07 17:51:31,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:31,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:31,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521728491] [2019-12-07 17:51:32,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:32,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:32,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:32,000 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 3 states. [2019-12-07 17:51:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:32,198 INFO L93 Difference]: Finished difference Result 21910 states and 79049 transitions. [2019-12-07 17:51:32,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:32,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 17:51:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:32,260 INFO L225 Difference]: With dead ends: 21910 [2019-12-07 17:51:32,260 INFO L226 Difference]: Without dead ends: 21910 [2019-12-07 17:51:32,260 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:51:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21910 states. [2019-12-07 17:51:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21910 to 21910. [2019-12-07 17:51:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21910 states. [2019-12-07 17:51:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21910 states to 21910 states and 79049 transitions. [2019-12-07 17:51:32,958 INFO L78 Accepts]: Start accepts. Automaton has 21910 states and 79049 transitions. Word has length 13 [2019-12-07 17:51:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:32,958 INFO L462 AbstractCegarLoop]: Abstraction has 21910 states and 79049 transitions. [2019-12-07 17:51:32,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21910 states and 79049 transitions. [2019-12-07 17:51:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:51:32,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:32,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:32,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1741557527, now seen corresponding path program 1 times [2019-12-07 17:51:32,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:32,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775602529] [2019-12-07 17:51:32,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:33,013 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:51:33,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775602529] [2019-12-07 17:51:33,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:33,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:33,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935638430] [2019-12-07 17:51:33,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:33,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:33,014 INFO L87 Difference]: Start difference. First operand 21910 states and 79049 transitions. Second operand 4 states. [2019-12-07 17:51:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:33,306 INFO L93 Difference]: Finished difference Result 33446 states and 115605 transitions. [2019-12-07 17:51:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:33,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:51:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:33,364 INFO L225 Difference]: With dead ends: 33446 [2019-12-07 17:51:33,364 INFO L226 Difference]: Without dead ends: 33430 [2019-12-07 17:51:33,365 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:51:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2019-12-07 17:51:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32663. [2019-12-07 17:51:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32663 states. [2019-12-07 17:51:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32663 states to 32663 states and 113580 transitions. [2019-12-07 17:51:34,266 INFO L78 Accepts]: Start accepts. Automaton has 32663 states and 113580 transitions. Word has length 14 [2019-12-07 17:51:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:34,266 INFO L462 AbstractCegarLoop]: Abstraction has 32663 states and 113580 transitions. [2019-12-07 17:51:34,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32663 states and 113580 transitions. [2019-12-07 17:51:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:51:34,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:34,268 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:51:34,268 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 17:51:34,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:34,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208597807] [2019-12-07 17:51:34,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:34,318 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:51:34,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208597807] [2019-12-07 17:51:34,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:34,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:34,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907009926] [2019-12-07 17:51:34,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:34,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:34,320 INFO L87 Difference]: Start difference. First operand 32663 states and 113580 transitions. Second operand 4 states. [2019-12-07 17:51:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:34,630 INFO L93 Difference]: Finished difference Result 41637 states and 142451 transitions. [2019-12-07 17:51:34,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:34,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:51:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:34,702 INFO L225 Difference]: With dead ends: 41637 [2019-12-07 17:51:34,702 INFO L226 Difference]: Without dead ends: 41624 [2019-12-07 17:51:34,702 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:51:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41624 states. [2019-12-07 17:51:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41624 to 37724. [2019-12-07 17:51:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37724 states. [2019-12-07 17:51:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37724 states to 37724 states and 130298 transitions. [2019-12-07 17:51:35,714 INFO L78 Accepts]: Start accepts. Automaton has 37724 states and 130298 transitions. Word has length 16 [2019-12-07 17:51:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:35,714 INFO L462 AbstractCegarLoop]: Abstraction has 37724 states and 130298 transitions. [2019-12-07 17:51:35,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37724 states and 130298 transitions. [2019-12-07 17:51:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:51:35,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:35,717 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:51:35,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:35,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 17:51:35,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:35,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464470228] [2019-12-07 17:51:35,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:35,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:51:35,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464470228] [2019-12-07 17:51:35,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:35,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:35,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086441422] [2019-12-07 17:51:35,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:35,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:35,743 INFO L87 Difference]: Start difference. First operand 37724 states and 130298 transitions. Second operand 3 states. [2019-12-07 17:51:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:36,014 INFO L93 Difference]: Finished difference Result 64399 states and 211767 transitions. [2019-12-07 17:51:36,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:36,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:51:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:36,131 INFO L225 Difference]: With dead ends: 64399 [2019-12-07 17:51:36,131 INFO L226 Difference]: Without dead ends: 64399 [2019-12-07 17:51:36,131 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:51:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64399 states. [2019-12-07 17:51:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64399 to 57368. [2019-12-07 17:51:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-12-07 17:51:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 191630 transitions. [2019-12-07 17:51:37,522 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 191630 transitions. Word has length 17 [2019-12-07 17:51:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:37,522 INFO L462 AbstractCegarLoop]: Abstraction has 57368 states and 191630 transitions. [2019-12-07 17:51:37,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 191630 transitions. [2019-12-07 17:51:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:51:37,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:37,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:37,528 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1903393538, now seen corresponding path program 1 times [2019-12-07 17:51:37,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:37,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438763295] [2019-12-07 17:51:37,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:37,582 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:51:37,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438763295] [2019-12-07 17:51:37,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:37,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:37,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721442793] [2019-12-07 17:51:37,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:37,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:37,584 INFO L87 Difference]: Start difference. First operand 57368 states and 191630 transitions. Second operand 3 states. [2019-12-07 17:51:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:37,803 INFO L93 Difference]: Finished difference Result 57368 states and 189042 transitions. [2019-12-07 17:51:37,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:37,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:51:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:37,916 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 17:51:37,917 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 17:51:37,917 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:51:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 17:51:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 56683. [2019-12-07 17:51:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56683 states. [2019-12-07 17:51:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56683 states to 56683 states and 187059 transitions. [2019-12-07 17:51:39,179 INFO L78 Accepts]: Start accepts. Automaton has 56683 states and 187059 transitions. Word has length 19 [2019-12-07 17:51:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:39,179 INFO L462 AbstractCegarLoop]: Abstraction has 56683 states and 187059 transitions. [2019-12-07 17:51:39,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56683 states and 187059 transitions. [2019-12-07 17:51:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:51:39,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:39,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:39,183 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash -620191314, now seen corresponding path program 1 times [2019-12-07 17:51:39,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:39,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447108578] [2019-12-07 17:51:39,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:39,224 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:51:39,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447108578] [2019-12-07 17:51:39,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:39,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:39,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032115983] [2019-12-07 17:51:39,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:39,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:39,225 INFO L87 Difference]: Start difference. First operand 56683 states and 187059 transitions. Second operand 4 states. [2019-12-07 17:51:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:39,257 INFO L93 Difference]: Finished difference Result 8176 states and 22619 transitions. [2019-12-07 17:51:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:51:39,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:51:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:39,266 INFO L225 Difference]: With dead ends: 8176 [2019-12-07 17:51:39,266 INFO L226 Difference]: Without dead ends: 8176 [2019-12-07 17:51:39,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-12-07 17:51:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-12-07 17:51:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-12-07 17:51:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 22619 transitions. [2019-12-07 17:51:39,359 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 22619 transitions. Word has length 19 [2019-12-07 17:51:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:39,359 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 22619 transitions. [2019-12-07 17:51:39,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 22619 transitions. [2019-12-07 17:51:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:51:39,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:39,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:39,362 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:39,362 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 17:51:39,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:39,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618679] [2019-12-07 17:51:39,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:39,402 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:51:39,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78618679] [2019-12-07 17:51:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:39,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:51:39,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012725629] [2019-12-07 17:51:39,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:39,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:39,404 INFO L87 Difference]: Start difference. First operand 8176 states and 22619 transitions. Second operand 4 states. [2019-12-07 17:51:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:39,561 INFO L93 Difference]: Finished difference Result 10377 states and 28179 transitions. [2019-12-07 17:51:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:39,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:51:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:39,571 INFO L225 Difference]: With dead ends: 10377 [2019-12-07 17:51:39,571 INFO L226 Difference]: Without dead ends: 10377 [2019-12-07 17:51:39,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2019-12-07 17:51:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 8186. [2019-12-07 17:51:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-12-07 17:51:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 22651 transitions. [2019-12-07 17:51:39,675 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 22651 transitions. Word has length 19 [2019-12-07 17:51:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:39,676 INFO L462 AbstractCegarLoop]: Abstraction has 8186 states and 22651 transitions. [2019-12-07 17:51:39,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 22651 transitions. [2019-12-07 17:51:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:51:39,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:39,682 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] [2019-12-07 17:51:39,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 17:51:39,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:39,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30751293] [2019-12-07 17:51:39,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:39,734 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:51:39,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30751293] [2019-12-07 17:51:39,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:39,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:39,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589402093] [2019-12-07 17:51:39,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:51:39,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:51:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:39,735 INFO L87 Difference]: Start difference. First operand 8186 states and 22651 transitions. Second operand 5 states. [2019-12-07 17:51:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:39,978 INFO L93 Difference]: Finished difference Result 10954 states and 29336 transitions. [2019-12-07 17:51:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:51:39,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 17:51:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:39,989 INFO L225 Difference]: With dead ends: 10954 [2019-12-07 17:51:39,989 INFO L226 Difference]: Without dead ends: 10953 [2019-12-07 17:51:39,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:51:40,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10953 states. [2019-12-07 17:51:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10953 to 10182. [2019-12-07 17:51:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-12-07 17:51:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 27669 transitions. [2019-12-07 17:51:40,129 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 27669 transitions. Word has length 31 [2019-12-07 17:51:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:40,129 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 27669 transitions. [2019-12-07 17:51:40,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:51:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 27669 transitions. [2019-12-07 17:51:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:51:40,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:40,138 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] [2019-12-07 17:51:40,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1183609133, now seen corresponding path program 1 times [2019-12-07 17:51:40,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:40,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802938833] [2019-12-07 17:51:40,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:40,163 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:51:40,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802938833] [2019-12-07 17:51:40,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:40,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:40,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267253514] [2019-12-07 17:51:40,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:51:40,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:51:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:51:40,164 INFO L87 Difference]: Start difference. First operand 10182 states and 27669 transitions. Second operand 3 states. [2019-12-07 17:51:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:40,237 INFO L93 Difference]: Finished difference Result 10956 states and 28041 transitions. [2019-12-07 17:51:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:51:40,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 17:51:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:40,249 INFO L225 Difference]: With dead ends: 10956 [2019-12-07 17:51:40,249 INFO L226 Difference]: Without dead ends: 10956 [2019-12-07 17:51:40,249 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:51:40,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2019-12-07 17:51:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10312. [2019-12-07 17:51:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-12-07 17:51:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 26596 transitions. [2019-12-07 17:51:40,387 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 26596 transitions. Word has length 34 [2019-12-07 17:51:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:40,387 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 26596 transitions. [2019-12-07 17:51:40,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:51:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 26596 transitions. [2019-12-07 17:51:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:51:40,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:40,417 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] [2019-12-07 17:51:40,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1182175862, now seen corresponding path program 1 times [2019-12-07 17:51:40,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:40,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440922023] [2019-12-07 17:51:40,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:40,458 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:51:40,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440922023] [2019-12-07 17:51:40,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:40,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:40,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655200516] [2019-12-07 17:51:40,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:51:40,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:51:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:40,459 INFO L87 Difference]: Start difference. First operand 10312 states and 26596 transitions. Second operand 5 states. [2019-12-07 17:51:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:40,496 INFO L93 Difference]: Finished difference Result 7816 states and 21181 transitions. [2019-12-07 17:51:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:40,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 17:51:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:40,503 INFO L225 Difference]: With dead ends: 7816 [2019-12-07 17:51:40,503 INFO L226 Difference]: Without dead ends: 7816 [2019-12-07 17:51:40,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2019-12-07 17:51:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 6702. [2019-12-07 17:51:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2019-12-07 17:51:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 18470 transitions. [2019-12-07 17:51:40,583 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 18470 transitions. Word has length 36 [2019-12-07 17:51:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:40,583 INFO L462 AbstractCegarLoop]: Abstraction has 6702 states and 18470 transitions. [2019-12-07 17:51:40,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:51:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 18470 transitions. [2019-12-07 17:51:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:51:40,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:40,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:40,592 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 14672455, now seen corresponding path program 1 times [2019-12-07 17:51:40,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:40,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666442347] [2019-12-07 17:51:40,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:40,661 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:51:40,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666442347] [2019-12-07 17:51:40,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:40,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:40,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763532554] [2019-12-07 17:51:40,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:40,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:40,662 INFO L87 Difference]: Start difference. First operand 6702 states and 18470 transitions. Second operand 4 states. [2019-12-07 17:51:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:40,843 INFO L93 Difference]: Finished difference Result 10683 states and 29062 transitions. [2019-12-07 17:51:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:51:40,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 17:51:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:40,854 INFO L225 Difference]: With dead ends: 10683 [2019-12-07 17:51:40,854 INFO L226 Difference]: Without dead ends: 10683 [2019-12-07 17:51:40,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2019-12-07 17:51:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 7288. [2019-12-07 17:51:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7288 states. [2019-12-07 17:51:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 19815 transitions. [2019-12-07 17:51:40,954 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 19815 transitions. Word has length 62 [2019-12-07 17:51:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:40,954 INFO L462 AbstractCegarLoop]: Abstraction has 7288 states and 19815 transitions. [2019-12-07 17:51:40,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 19815 transitions. [2019-12-07 17:51:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:51:40,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:40,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:40,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2143606157, now seen corresponding path program 2 times [2019-12-07 17:51:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:40,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426204659] [2019-12-07 17:51:40,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:41,046 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:51:41,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426204659] [2019-12-07 17:51:41,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:41,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:51:41,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554210327] [2019-12-07 17:51:41,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:51:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:41,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:51:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:51:41,048 INFO L87 Difference]: Start difference. First operand 7288 states and 19815 transitions. Second operand 6 states. [2019-12-07 17:51:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:41,326 INFO L93 Difference]: Finished difference Result 8409 states and 22599 transitions. [2019-12-07 17:51:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:51:41,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 17:51:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:41,334 INFO L225 Difference]: With dead ends: 8409 [2019-12-07 17:51:41,334 INFO L226 Difference]: Without dead ends: 8409 [2019-12-07 17:51:41,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:51:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8409 states. [2019-12-07 17:51:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8409 to 7458. [2019-12-07 17:51:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7458 states. [2019-12-07 17:51:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7458 states to 7458 states and 20170 transitions. [2019-12-07 17:51:41,420 INFO L78 Accepts]: Start accepts. Automaton has 7458 states and 20170 transitions. Word has length 62 [2019-12-07 17:51:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:41,420 INFO L462 AbstractCegarLoop]: Abstraction has 7458 states and 20170 transitions. [2019-12-07 17:51:41,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:51:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7458 states and 20170 transitions. [2019-12-07 17:51:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:51:41,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:41,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:41,429 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2085196129, now seen corresponding path program 3 times [2019-12-07 17:51:41,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:41,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830369867] [2019-12-07 17:51:41,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:41,514 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:51:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830369867] [2019-12-07 17:51:41,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:41,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:51:41,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001467728] [2019-12-07 17:51:41,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:51:41,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:51:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:51:41,515 INFO L87 Difference]: Start difference. First operand 7458 states and 20170 transitions. Second operand 6 states. [2019-12-07 17:51:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:41,839 INFO L93 Difference]: Finished difference Result 10163 states and 27272 transitions. [2019-12-07 17:51:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:51:41,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 17:51:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:41,849 INFO L225 Difference]: With dead ends: 10163 [2019-12-07 17:51:41,849 INFO L226 Difference]: Without dead ends: 10163 [2019-12-07 17:51:41,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:51:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2019-12-07 17:51:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 7804. [2019-12-07 17:51:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7804 states. [2019-12-07 17:51:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7804 states to 7804 states and 21095 transitions. [2019-12-07 17:51:41,950 INFO L78 Accepts]: Start accepts. Automaton has 7804 states and 21095 transitions. Word has length 62 [2019-12-07 17:51:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:41,950 INFO L462 AbstractCegarLoop]: Abstraction has 7804 states and 21095 transitions. [2019-12-07 17:51:41,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:51:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7804 states and 21095 transitions. [2019-12-07 17:51:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:51:41,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:41,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:41,961 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 4 times [2019-12-07 17:51:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571883747] [2019-12-07 17:51:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:42,013 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:51:42,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571883747] [2019-12-07 17:51:42,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:42,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:42,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414036258] [2019-12-07 17:51:42,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:51:42,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:51:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:42,015 INFO L87 Difference]: Start difference. First operand 7804 states and 21095 transitions. Second operand 5 states. [2019-12-07 17:51:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:42,182 INFO L93 Difference]: Finished difference Result 9669 states and 25603 transitions. [2019-12-07 17:51:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:51:42,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 17:51:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:42,191 INFO L225 Difference]: With dead ends: 9669 [2019-12-07 17:51:42,191 INFO L226 Difference]: Without dead ends: 9669 [2019-12-07 17:51:42,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:51:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2019-12-07 17:51:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 8374. [2019-12-07 17:51:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8374 states. [2019-12-07 17:51:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8374 states to 8374 states and 22502 transitions. [2019-12-07 17:51:42,290 INFO L78 Accepts]: Start accepts. Automaton has 8374 states and 22502 transitions. Word has length 62 [2019-12-07 17:51:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:42,290 INFO L462 AbstractCegarLoop]: Abstraction has 8374 states and 22502 transitions. [2019-12-07 17:51:42,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:51:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8374 states and 22502 transitions. [2019-12-07 17:51:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:42,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:42,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:42,302 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 17:51:42,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:42,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464770543] [2019-12-07 17:51:42,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:42,393 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:51:42,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464770543] [2019-12-07 17:51:42,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:42,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:42,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319602198] [2019-12-07 17:51:42,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:51:42,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:51:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:51:42,395 INFO L87 Difference]: Start difference. First operand 8374 states and 22502 transitions. Second operand 6 states. [2019-12-07 17:51:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:42,507 INFO L93 Difference]: Finished difference Result 12829 states and 34625 transitions. [2019-12-07 17:51:42,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:51:42,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 17:51:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:42,518 INFO L225 Difference]: With dead ends: 12829 [2019-12-07 17:51:42,518 INFO L226 Difference]: Without dead ends: 11744 [2019-12-07 17:51:42,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:51:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11744 states. [2019-12-07 17:51:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11744 to 10024. [2019-12-07 17:51:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10024 states. [2019-12-07 17:51:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10024 states to 10024 states and 26951 transitions. [2019-12-07 17:51:42,642 INFO L78 Accepts]: Start accepts. Automaton has 10024 states and 26951 transitions. Word has length 63 [2019-12-07 17:51:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:42,642 INFO L462 AbstractCegarLoop]: Abstraction has 10024 states and 26951 transitions. [2019-12-07 17:51:42,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:51:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10024 states and 26951 transitions. [2019-12-07 17:51:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:42,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:42,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:42,653 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1785952972, now seen corresponding path program 2 times [2019-12-07 17:51:42,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:42,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798754199] [2019-12-07 17:51:42,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:42,869 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:51:42,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798754199] [2019-12-07 17:51:42,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:42,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:51:42,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654949740] [2019-12-07 17:51:42,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:51:42,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:51:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:51:42,870 INFO L87 Difference]: Start difference. First operand 10024 states and 26951 transitions. Second operand 12 states. [2019-12-07 17:51:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:43,791 INFO L93 Difference]: Finished difference Result 13060 states and 33381 transitions. [2019-12-07 17:51:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 17:51:43,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 17:51:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:43,803 INFO L225 Difference]: With dead ends: 13060 [2019-12-07 17:51:43,803 INFO L226 Difference]: Without dead ends: 12605 [2019-12-07 17:51:43,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:51:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12605 states. [2019-12-07 17:51:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12605 to 10755. [2019-12-07 17:51:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10755 states. [2019-12-07 17:51:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10755 states to 10755 states and 28558 transitions. [2019-12-07 17:51:43,939 INFO L78 Accepts]: Start accepts. Automaton has 10755 states and 28558 transitions. Word has length 63 [2019-12-07 17:51:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:43,940 INFO L462 AbstractCegarLoop]: Abstraction has 10755 states and 28558 transitions. [2019-12-07 17:51:43,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:51:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10755 states and 28558 transitions. [2019-12-07 17:51:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:43,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:43,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:43,949 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -437937848, now seen corresponding path program 3 times [2019-12-07 17:51:43,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:43,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99675106] [2019-12-07 17:51:43,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:44,000 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:51:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99675106] [2019-12-07 17:51:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809284762] [2019-12-07 17:51:44,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:44,002 INFO L87 Difference]: Start difference. First operand 10755 states and 28558 transitions. Second operand 4 states. [2019-12-07 17:51:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:44,036 INFO L93 Difference]: Finished difference Result 11625 states and 30438 transitions. [2019-12-07 17:51:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:51:44,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 17:51:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:44,042 INFO L225 Difference]: With dead ends: 11625 [2019-12-07 17:51:44,042 INFO L226 Difference]: Without dead ends: 5878 [2019-12-07 17:51:44,043 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:51:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-12-07 17:51:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5878. [2019-12-07 17:51:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-12-07 17:51:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 13708 transitions. [2019-12-07 17:51:44,099 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 13708 transitions. Word has length 63 [2019-12-07 17:51:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:44,100 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 13708 transitions. [2019-12-07 17:51:44,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 13708 transitions. [2019-12-07 17:51:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:44,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:44,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:44,104 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1580623076, now seen corresponding path program 4 times [2019-12-07 17:51:44,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:44,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584012454] [2019-12-07 17:51:44,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:44,168 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:51:44,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584012454] [2019-12-07 17:51:44,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:44,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:51:44,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991714214] [2019-12-07 17:51:44,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:51:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:51:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:51:44,169 INFO L87 Difference]: Start difference. First operand 5878 states and 13708 transitions. Second operand 4 states. [2019-12-07 17:51:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:44,213 INFO L93 Difference]: Finished difference Result 6346 states and 14708 transitions. [2019-12-07 17:51:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:44,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 17:51:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:44,217 INFO L225 Difference]: With dead ends: 6346 [2019-12-07 17:51:44,217 INFO L226 Difference]: Without dead ends: 4991 [2019-12-07 17:51:44,218 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:51:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-12-07 17:51:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4573. [2019-12-07 17:51:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2019-12-07 17:51:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 10745 transitions. [2019-12-07 17:51:44,262 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 10745 transitions. Word has length 63 [2019-12-07 17:51:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:44,262 INFO L462 AbstractCegarLoop]: Abstraction has 4573 states and 10745 transitions. [2019-12-07 17:51:44,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:51:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 10745 transitions. [2019-12-07 17:51:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:44,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:44,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:44,266 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash 76538126, now seen corresponding path program 5 times [2019-12-07 17:51:44,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:44,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339152895] [2019-12-07 17:51:44,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:44,354 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:51:44,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339152895] [2019-12-07 17:51:44,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:44,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:51:44,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264250875] [2019-12-07 17:51:44,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:51:44,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:51:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:51:44,355 INFO L87 Difference]: Start difference. First operand 4573 states and 10745 transitions. Second operand 5 states. [2019-12-07 17:51:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:44,384 INFO L93 Difference]: Finished difference Result 5035 states and 11735 transitions. [2019-12-07 17:51:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:51:44,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 17:51:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:44,385 INFO L225 Difference]: With dead ends: 5035 [2019-12-07 17:51:44,385 INFO L226 Difference]: Without dead ends: 529 [2019-12-07 17:51:44,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:51:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-07 17:51:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-07 17:51:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 17:51:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1082 transitions. [2019-12-07 17:51:44,390 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1082 transitions. Word has length 63 [2019-12-07 17:51:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:44,390 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1082 transitions. [2019-12-07 17:51:44,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:51:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1082 transitions. [2019-12-07 17:51:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:44,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:44,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:44,391 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 6 times [2019-12-07 17:51:44,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:44,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791673585] [2019-12-07 17:51:44,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:51:44,494 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:51:44,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791673585] [2019-12-07 17:51:44,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:51:44,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:51:44,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270416102] [2019-12-07 17:51:44,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:51:44,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:51:44,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:51:44,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:51:44,495 INFO L87 Difference]: Start difference. First operand 529 states and 1082 transitions. Second operand 8 states. [2019-12-07 17:51:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:51:44,684 INFO L93 Difference]: Finished difference Result 1075 states and 2199 transitions. [2019-12-07 17:51:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:51:44,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 17:51:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:51:44,685 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 17:51:44,685 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 17:51:44,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:51:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 17:51:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 606. [2019-12-07 17:51:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-07 17:51:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1216 transitions. [2019-12-07 17:51:44,693 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1216 transitions. Word has length 63 [2019-12-07 17:51:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:51:44,694 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1216 transitions. [2019-12-07 17:51:44,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:51:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1216 transitions. [2019-12-07 17:51:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:51:44,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:51:44,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:51:44,695 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:51:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:51:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 7 times [2019-12-07 17:51:44,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:51:44,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759303593] [2019-12-07 17:51:44,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:51:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:51:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:51:44,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:51:44,789 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:51:44,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= (select .cse0 |v_ULTIMATE.start_main_~#t41~0.base_132|) 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t41~0.base_132|) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (= |v_ULTIMATE.start_main_~#t41~0.offset_73| 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t41~0.base_132| 4) |v_#length_23|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t41~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t41~0.base_132|) |v_ULTIMATE.start_main_~#t41~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_#valid_167| (store .cse0 |v_ULTIMATE.start_main_~#t41~0.base_132| 1)) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t42~0.offset=|v_ULTIMATE.start_main_~#t42~0.offset_35|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t43~0.base=|v_ULTIMATE.start_main_~#t43~0.base_56|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_~#t41~0.base=|v_ULTIMATE.start_main_~#t41~0.base_132|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ULTIMATE.start_main_~#t42~0.base=|v_ULTIMATE.start_main_~#t42~0.base_94|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ULTIMATE.start_main_~#t41~0.offset=|v_ULTIMATE.start_main_~#t41~0.offset_73|, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76, ULTIMATE.start_main_~#t43~0.offset=|v_ULTIMATE.start_main_~#t43~0.offset_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t42~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t43~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t41~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t42~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t41~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t43~0.offset] because there is no mapped edge [2019-12-07 17:51:44,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_ULTIMATE.start_main_~#t42~0.offset_9| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t42~0.base_10| 1)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t42~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t42~0.base_10| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t42~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t42~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t42~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t42~0.base_10|) |v_ULTIMATE.start_main_~#t42~0.offset_9| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t42~0.offset=|v_ULTIMATE.start_main_~#t42~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t42~0.base=|v_ULTIMATE.start_main_~#t42~0.base_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t42~0.offset, ULTIMATE.start_main_~#t42~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:51:44,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t43~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t43~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t43~0.base_11|) |v_ULTIMATE.start_main_~#t43~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t43~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t43~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t43~0.base_11|) (= |v_ULTIMATE.start_main_~#t43~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t43~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t43~0.offset=|v_ULTIMATE.start_main_~#t43~0.offset_9|, ULTIMATE.start_main_~#t43~0.base=|v_ULTIMATE.start_main_~#t43~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t43~0.offset, ULTIMATE.start_main_~#t43~0.base] because there is no mapped edge [2019-12-07 17:51:44,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:51:44,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out970160810| |P2Thread1of1ForFork0_#t~ite28_Out970160810|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In970160810 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In970160810 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out970160810| ~z$w_buff0~0_In970160810) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In970160810 |P2Thread1of1ForFork0_#t~ite28_Out970160810|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In970160810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In970160810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In970160810, ~z$w_buff1~0=~z$w_buff1~0_In970160810} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out970160810|, ~z$w_buff0~0=~z$w_buff0~0_In970160810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In970160810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In970160810, ~z$w_buff1~0=~z$w_buff1~0_In970160810, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out970160810|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:51:44,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:51:44,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1168567927 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1168567927| ~z$mem_tmp~0_In-1168567927) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-1168567927| ~z~0_In-1168567927)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1168567927, ~z$flush_delayed~0=~z$flush_delayed~0_In-1168567927, ~z~0=~z~0_In-1168567927} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1168567927|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1168567927, ~z$flush_delayed~0=~z$flush_delayed~0_In-1168567927, ~z~0=~z~0_In-1168567927} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:51:44,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:51:44,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1976862901 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1976862901 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1976862901|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1976862901 |P2Thread1of1ForFork0_#t~ite51_Out-1976862901|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976862901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976862901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976862901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976862901, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1976862901|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:51:44,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1093953760 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1093953760| ~z~0_In1093953760) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out1093953760| ~z$mem_tmp~0_In1093953760)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1093953760, ~z$flush_delayed~0=~z$flush_delayed~0_In1093953760, ~z~0=~z~0_In1093953760} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1093953760, ~z$flush_delayed~0=~z$flush_delayed~0_In1093953760, ~z~0=~z~0_In1093953760, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1093953760|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:51:44,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:51:44,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-282626468 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-282626468 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-282626468 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-282626468 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-282626468| ~z$w_buff1_used~0_In-282626468) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-282626468|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-282626468, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-282626468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282626468, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-282626468} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-282626468, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-282626468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282626468, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-282626468|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-282626468} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:51:44,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-2120326120 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2120326120 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-2120326120 ~z$r_buff0_thd3~0_Out-2120326120))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-2120326120)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120326120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2120326120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120326120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2120326120, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2120326120|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:51:44,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In250737329 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In250737329 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In250737329 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In250737329 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out250737329| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite54_Out250737329| ~z$r_buff1_thd3~0_In250737329) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In250737329, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In250737329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In250737329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In250737329} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In250737329, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out250737329|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In250737329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In250737329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In250737329} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:51:44,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:51:44,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:51:44,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1661598566 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1661598566 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1661598566| |ULTIMATE.start_main_#t~ite58_Out-1661598566|))) (or (and (= ~z$w_buff1~0_In-1661598566 |ULTIMATE.start_main_#t~ite58_Out-1661598566|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-1661598566 |ULTIMATE.start_main_#t~ite58_Out-1661598566|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661598566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661598566, ~z$w_buff1~0=~z$w_buff1~0_In-1661598566, ~z~0=~z~0_In-1661598566} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661598566, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1661598566|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661598566, ~z$w_buff1~0=~z$w_buff1~0_In-1661598566, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1661598566|, ~z~0=~z~0_In-1661598566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:51:44,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1436156662 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1436156662 256)))) (or (and (= ~z$w_buff0_used~0_In-1436156662 |ULTIMATE.start_main_#t~ite60_Out-1436156662|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1436156662|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436156662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436156662} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1436156662|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436156662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436156662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:51:44,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1264913380 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1264913380 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1264913380 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1264913380 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1264913380|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1264913380 |ULTIMATE.start_main_#t~ite61_Out1264913380|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1264913380, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1264913380, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264913380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264913380} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1264913380, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1264913380|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1264913380, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264913380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264913380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:51:44,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In45119968 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In45119968 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out45119968|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In45119968 |ULTIMATE.start_main_#t~ite62_Out45119968|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In45119968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45119968} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out45119968|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In45119968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45119968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:51:44,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1712957538 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1712957538 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1712957538 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1712957538 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1712957538| ~z$r_buff1_thd0~0_In-1712957538) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1712957538|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1712957538, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712957538, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1712957538, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712957538} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1712957538|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1712957538, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712957538, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1712957538, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712957538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:51:44,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:51:44,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:51:44 BasicIcfg [2019-12-07 17:51:44,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:51:44,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:51:44,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:51:44,896 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:51:44,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:51:22" (3/4) ... [2019-12-07 17:51:44,898 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:51:44,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= (select .cse0 |v_ULTIMATE.start_main_~#t41~0.base_132|) 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t41~0.base_132|) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (= |v_ULTIMATE.start_main_~#t41~0.offset_73| 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t41~0.base_132| 4) |v_#length_23|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t41~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t41~0.base_132|) |v_ULTIMATE.start_main_~#t41~0.offset_73| 0)) |v_#memory_int_23|) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_#valid_167| (store .cse0 |v_ULTIMATE.start_main_~#t41~0.base_132| 1)) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t42~0.offset=|v_ULTIMATE.start_main_~#t42~0.offset_35|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t43~0.base=|v_ULTIMATE.start_main_~#t43~0.base_56|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_~#t41~0.base=|v_ULTIMATE.start_main_~#t41~0.base_132|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ULTIMATE.start_main_~#t42~0.base=|v_ULTIMATE.start_main_~#t42~0.base_94|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ULTIMATE.start_main_~#t41~0.offset=|v_ULTIMATE.start_main_~#t41~0.offset_73|, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76, ULTIMATE.start_main_~#t43~0.offset=|v_ULTIMATE.start_main_~#t43~0.offset_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t42~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t43~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t41~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t42~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t41~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t43~0.offset] because there is no mapped edge [2019-12-07 17:51:44,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_ULTIMATE.start_main_~#t42~0.offset_9| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t42~0.base_10| 1)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t42~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t42~0.base_10| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t42~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t42~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t42~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t42~0.base_10|) |v_ULTIMATE.start_main_~#t42~0.offset_9| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t42~0.offset=|v_ULTIMATE.start_main_~#t42~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t42~0.base=|v_ULTIMATE.start_main_~#t42~0.base_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t42~0.offset, ULTIMATE.start_main_~#t42~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:51:44,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t43~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t43~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t43~0.base_11|) |v_ULTIMATE.start_main_~#t43~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t43~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t43~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t43~0.base_11|) (= |v_ULTIMATE.start_main_~#t43~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t43~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t43~0.offset=|v_ULTIMATE.start_main_~#t43~0.offset_9|, ULTIMATE.start_main_~#t43~0.base=|v_ULTIMATE.start_main_~#t43~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t43~0.offset, ULTIMATE.start_main_~#t43~0.base] because there is no mapped edge [2019-12-07 17:51:44,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:51:44,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out970160810| |P2Thread1of1ForFork0_#t~ite28_Out970160810|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In970160810 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In970160810 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out970160810| ~z$w_buff0~0_In970160810) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In970160810 |P2Thread1of1ForFork0_#t~ite28_Out970160810|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In970160810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In970160810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In970160810, ~z$w_buff1~0=~z$w_buff1~0_In970160810} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out970160810|, ~z$w_buff0~0=~z$w_buff0~0_In970160810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In970160810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In970160810, ~z$w_buff1~0=~z$w_buff1~0_In970160810, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out970160810|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:51:44,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:51:44,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1168567927 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1168567927| ~z$mem_tmp~0_In-1168567927) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-1168567927| ~z~0_In-1168567927)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1168567927, ~z$flush_delayed~0=~z$flush_delayed~0_In-1168567927, ~z~0=~z~0_In-1168567927} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1168567927|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1168567927, ~z$flush_delayed~0=~z$flush_delayed~0_In-1168567927, ~z~0=~z~0_In-1168567927} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:51:44,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:51:44,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1976862901 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1976862901 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1976862901|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1976862901 |P2Thread1of1ForFork0_#t~ite51_Out-1976862901|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976862901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976862901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1976862901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1976862901, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1976862901|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:51:44,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1093953760 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1093953760| ~z~0_In1093953760) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out1093953760| ~z$mem_tmp~0_In1093953760)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1093953760, ~z$flush_delayed~0=~z$flush_delayed~0_In1093953760, ~z~0=~z~0_In1093953760} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1093953760, ~z$flush_delayed~0=~z$flush_delayed~0_In1093953760, ~z~0=~z~0_In1093953760, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1093953760|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:51:44,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:51:44,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-282626468 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-282626468 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-282626468 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-282626468 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-282626468| ~z$w_buff1_used~0_In-282626468) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-282626468|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-282626468, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-282626468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282626468, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-282626468} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-282626468, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-282626468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282626468, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-282626468|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-282626468} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:51:44,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-2120326120 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2120326120 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-2120326120 ~z$r_buff0_thd3~0_Out-2120326120))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-2120326120)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120326120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2120326120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120326120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2120326120, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2120326120|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:51:44,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In250737329 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In250737329 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In250737329 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In250737329 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out250737329| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite54_Out250737329| ~z$r_buff1_thd3~0_In250737329) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In250737329, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In250737329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In250737329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In250737329} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In250737329, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out250737329|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In250737329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In250737329, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In250737329} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:51:44,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:51:44,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:51:44,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1661598566 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1661598566 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1661598566| |ULTIMATE.start_main_#t~ite58_Out-1661598566|))) (or (and (= ~z$w_buff1~0_In-1661598566 |ULTIMATE.start_main_#t~ite58_Out-1661598566|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-1661598566 |ULTIMATE.start_main_#t~ite58_Out-1661598566|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661598566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661598566, ~z$w_buff1~0=~z$w_buff1~0_In-1661598566, ~z~0=~z~0_In-1661598566} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661598566, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1661598566|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661598566, ~z$w_buff1~0=~z$w_buff1~0_In-1661598566, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1661598566|, ~z~0=~z~0_In-1661598566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:51:44,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1436156662 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1436156662 256)))) (or (and (= ~z$w_buff0_used~0_In-1436156662 |ULTIMATE.start_main_#t~ite60_Out-1436156662|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1436156662|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436156662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436156662} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1436156662|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436156662, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436156662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:51:44,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1264913380 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1264913380 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1264913380 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1264913380 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1264913380|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1264913380 |ULTIMATE.start_main_#t~ite61_Out1264913380|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1264913380, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1264913380, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264913380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264913380} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1264913380, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1264913380|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1264913380, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1264913380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264913380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:51:44,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In45119968 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In45119968 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out45119968|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In45119968 |ULTIMATE.start_main_#t~ite62_Out45119968|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In45119968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45119968} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out45119968|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In45119968, ~z$w_buff0_used~0=~z$w_buff0_used~0_In45119968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:51:44,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1712957538 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1712957538 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1712957538 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1712957538 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1712957538| ~z$r_buff1_thd0~0_In-1712957538) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1712957538|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1712957538, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712957538, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1712957538, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712957538} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1712957538|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1712957538, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712957538, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1712957538, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712957538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:51:44,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:51:44,992 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f20b52b-8c50-4254-acb7-b2be13adf937/bin/uautomizer/witness.graphml [2019-12-07 17:51:44,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:51:44,993 INFO L168 Benchmark]: Toolchain (without parser) took 23087.02 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 939.8 MB in the beginning and 1.7 GB in the end (delta: -712.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,994 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:51:44,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:51:44,995 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,995 INFO L168 Benchmark]: RCFGBuilder took 433.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,995 INFO L168 Benchmark]: TraceAbstraction took 22100.79 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 996.5 MB in the beginning and 1.7 GB in the end (delta: -700.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,996 INFO L168 Benchmark]: Witness Printer took 96.66 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:51:44,998 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 433.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22100.79 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 996.5 MB in the beginning and 1.7 GB in the end (delta: -700.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 96.66 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4218 SDtfs, 4262 SDslu, 8781 SDs, 0 SdLazy, 3318 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 37 SyntacticMatches, 12 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57368occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 29237 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 914 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 271084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...