./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_tso.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_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/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 e0dc76b03a955eb2638ed398e73a03eb979e8b97 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:07:36,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:36,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:36,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:36,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:36,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:36,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:36,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:36,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:36,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:36,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:36,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:36,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:36,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:36,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:36,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:36,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:36,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:36,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:36,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:36,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:36,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:36,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:36,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:36,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:36,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:36,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:36,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:36,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:36,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:36,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:36,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:36,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:36,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:36,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:36,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:36,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:36,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:36,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:36,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:36,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:36,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:36,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:36,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:36,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:36,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:36,312 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:36,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:36,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:36,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:36,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:36,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:36,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:36,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:36,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:36,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:36,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:36,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:36,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:36,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:36,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:36,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:36,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:36,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:36,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:36,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:36,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:36,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:36,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:36,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:36,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:36,317 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_b186641d-0086-4713-b9f7-006946a56c02/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 -> e0dc76b03a955eb2638ed398e73a03eb979e8b97 [2019-12-07 10:07:36,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:36,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:36,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:36,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:36,435 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:36,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i [2019-12-07 10:07:36,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/data/025611063/5e98187a09b84c77aef1676791908e4f/FLAG8c87cfccb [2019-12-07 10:07:36,961 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:36,961 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/sv-benchmarks/c/pthread-wmm/mix010_tso.opt.i [2019-12-07 10:07:36,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/data/025611063/5e98187a09b84c77aef1676791908e4f/FLAG8c87cfccb [2019-12-07 10:07:36,983 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/data/025611063/5e98187a09b84c77aef1676791908e4f [2019-12-07 10:07:36,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:36,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:36,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:36,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:36,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:36,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:36" (1/1) ... [2019-12-07 10:07:36,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:36, skipping insertion in model container [2019-12-07 10:07:36,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:36" (1/1) ... [2019-12-07 10:07:36,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:37,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:37,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:37,305 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:37,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:37,395 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:37,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37 WrapperNode [2019-12-07 10:07:37,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:37,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:37,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:37,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:37,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:37,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:37,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:37,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:37,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... [2019-12-07 10:07:37,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:37,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:37,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:37,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:37,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/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 10:07:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:07:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:07:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:37,512 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 10:07:37,906 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:37,906 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:37,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:37 BoogieIcfgContainer [2019-12-07 10:07:37,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:37,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:37,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:37,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:37,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:36" (1/3) ... [2019-12-07 10:07:37,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29115362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:37, skipping insertion in model container [2019-12-07 10:07:37,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37" (2/3) ... [2019-12-07 10:07:37,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29115362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:37, skipping insertion in model container [2019-12-07 10:07:37,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:37" (3/3) ... [2019-12-07 10:07:37,912 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_tso.opt.i [2019-12-07 10:07:37,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:37,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:37,923 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:37,924 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:37,988 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:07:38,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:38,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:38,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:38,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:38,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:38,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:38,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:38,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:38,011 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 10:07:38,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 10:07:38,073 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 10:07:38,073 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:38,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:07:38,109 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 10:07:38,144 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 10:07:38,144 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:38,152 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:07:38,176 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 10:07:38,177 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:41,566 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 10:07:41,927 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 10:07:42,032 INFO L206 etLargeBlockEncoding]: Checked pairs total: 138188 [2019-12-07 10:07:42,032 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 10:07:42,034 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 129 transitions [2019-12-07 10:07:44,773 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-07 10:07:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-07 10:07:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:07:44,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:44,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:44,780 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 10:07:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1166715454, now seen corresponding path program 1 times [2019-12-07 10:07:44,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:44,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686052370] [2019-12-07 10:07:44,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:44,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686052370] [2019-12-07 10:07:44,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:44,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:44,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863857290] [2019-12-07 10:07:44,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:44,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:44,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:44,964 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-07 10:07:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:45,361 INFO L93 Difference]: Finished difference Result 43270 states and 177632 transitions. [2019-12-07 10:07:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:45,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:07:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:45,601 INFO L225 Difference]: With dead ends: 43270 [2019-12-07 10:07:45,601 INFO L226 Difference]: Without dead ends: 40300 [2019-12-07 10:07:45,602 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 10:07:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40300 states. [2019-12-07 10:07:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40300 to 40300. [2019-12-07 10:07:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2019-12-07 10:07:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 165323 transitions. [2019-12-07 10:07:47,121 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 165323 transitions. Word has length 7 [2019-12-07 10:07:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:47,122 INFO L462 AbstractCegarLoop]: Abstraction has 40300 states and 165323 transitions. [2019-12-07 10:07:47,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 165323 transitions. [2019-12-07 10:07:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:07:47,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,126 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 10:07:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 446345132, now seen corresponding path program 1 times [2019-12-07 10:07:47,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599060515] [2019-12-07 10:07:47,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,194 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 10:07:47,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599060515] [2019-12-07 10:07:47,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:47,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:47,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824885425] [2019-12-07 10:07:47,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:47,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:47,196 INFO L87 Difference]: Start difference. First operand 40300 states and 165323 transitions. Second operand 4 states. [2019-12-07 10:07:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,875 INFO L93 Difference]: Finished difference Result 64232 states and 253053 transitions. [2019-12-07 10:07:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:47,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:07:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:48,207 INFO L225 Difference]: With dead ends: 64232 [2019-12-07 10:07:48,208 INFO L226 Difference]: Without dead ends: 64202 [2019-12-07 10:07:48,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 10:07:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64202 states. [2019-12-07 10:07:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64202 to 62556. [2019-12-07 10:07:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62556 states. [2019-12-07 10:07:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 247863 transitions. [2019-12-07 10:07:50,158 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 247863 transitions. Word has length 13 [2019-12-07 10:07:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:50,158 INFO L462 AbstractCegarLoop]: Abstraction has 62556 states and 247863 transitions. [2019-12-07 10:07:50,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 247863 transitions. [2019-12-07 10:07:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:07:50,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:50,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:50,165 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 10:07:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1030418596, now seen corresponding path program 1 times [2019-12-07 10:07:50,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:50,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139816197] [2019-12-07 10:07:50,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:50,226 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 10:07:50,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139816197] [2019-12-07 10:07:50,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:50,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:50,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515189431] [2019-12-07 10:07:50,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:50,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:50,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:50,228 INFO L87 Difference]: Start difference. First operand 62556 states and 247863 transitions. Second operand 4 states. [2019-12-07 10:07:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:50,711 INFO L93 Difference]: Finished difference Result 80364 states and 313729 transitions. [2019-12-07 10:07:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:50,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:07:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:50,881 INFO L225 Difference]: With dead ends: 80364 [2019-12-07 10:07:50,881 INFO L226 Difference]: Without dead ends: 80336 [2019-12-07 10:07:50,881 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 10:07:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80336 states. [2019-12-07 10:07:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80336 to 71524. [2019-12-07 10:07:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71524 states. [2019-12-07 10:07:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71524 states to 71524 states and 281953 transitions. [2019-12-07 10:07:53,805 INFO L78 Accepts]: Start accepts. Automaton has 71524 states and 281953 transitions. Word has length 16 [2019-12-07 10:07:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:53,805 INFO L462 AbstractCegarLoop]: Abstraction has 71524 states and 281953 transitions. [2019-12-07 10:07:53,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 71524 states and 281953 transitions. [2019-12-07 10:07:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:07:53,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:53,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:53,812 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 10:07:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash -239561606, now seen corresponding path program 1 times [2019-12-07 10:07:53,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:53,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519245030] [2019-12-07 10:07:53,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:53,852 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 10:07:53,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519245030] [2019-12-07 10:07:53,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:53,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:53,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839942322] [2019-12-07 10:07:53,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:53,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:53,854 INFO L87 Difference]: Start difference. First operand 71524 states and 281953 transitions. Second operand 3 states. [2019-12-07 10:07:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:54,259 INFO L93 Difference]: Finished difference Result 71524 states and 278893 transitions. [2019-12-07 10:07:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:54,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:07:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:54,409 INFO L225 Difference]: With dead ends: 71524 [2019-12-07 10:07:54,409 INFO L226 Difference]: Without dead ends: 71524 [2019-12-07 10:07:54,409 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 10:07:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71524 states. [2019-12-07 10:07:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71524 to 71316. [2019-12-07 10:07:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71316 states. [2019-12-07 10:07:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71316 states to 71316 states and 278233 transitions. [2019-12-07 10:07:56,402 INFO L78 Accepts]: Start accepts. Automaton has 71316 states and 278233 transitions. Word has length 18 [2019-12-07 10:07:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:56,402 INFO L462 AbstractCegarLoop]: Abstraction has 71316 states and 278233 transitions. [2019-12-07 10:07:56,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 71316 states and 278233 transitions. [2019-12-07 10:07:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:07:56,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:56,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:56,406 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 10:07:56,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash 419417230, now seen corresponding path program 1 times [2019-12-07 10:07:56,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:56,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139604842] [2019-12-07 10:07:56,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,461 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 10:07:56,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139604842] [2019-12-07 10:07:56,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:56,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:56,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781117172] [2019-12-07 10:07:56,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:56,463 INFO L87 Difference]: Start difference. First operand 71316 states and 278233 transitions. Second operand 3 states. [2019-12-07 10:07:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:56,733 INFO L93 Difference]: Finished difference Result 71336 states and 278133 transitions. [2019-12-07 10:07:56,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:56,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:07:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:56,881 INFO L225 Difference]: With dead ends: 71336 [2019-12-07 10:07:56,881 INFO L226 Difference]: Without dead ends: 71336 [2019-12-07 10:07:56,881 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 10:07:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71336 states. [2019-12-07 10:07:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71336 to 71251. [2019-12-07 10:07:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71251 states. [2019-12-07 10:07:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71251 states to 71251 states and 277954 transitions. [2019-12-07 10:07:58,778 INFO L78 Accepts]: Start accepts. Automaton has 71251 states and 277954 transitions. Word has length 18 [2019-12-07 10:07:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,778 INFO L462 AbstractCegarLoop]: Abstraction has 71251 states and 277954 transitions. [2019-12-07 10:07:58,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 71251 states and 277954 transitions. [2019-12-07 10:07:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:07:58,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,786 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 10:07:58,786 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 10:07:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -87585687, now seen corresponding path program 1 times [2019-12-07 10:07:58,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563139899] [2019-12-07 10:07:58,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,845 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 10:07:58,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563139899] [2019-12-07 10:07:58,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:58,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660583233] [2019-12-07 10:07:58,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:58,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:58,847 INFO L87 Difference]: Start difference. First operand 71251 states and 277954 transitions. Second operand 4 states. [2019-12-07 10:07:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,104 INFO L93 Difference]: Finished difference Result 66904 states and 260443 transitions. [2019-12-07 10:07:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:59,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:07:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,241 INFO L225 Difference]: With dead ends: 66904 [2019-12-07 10:07:59,241 INFO L226 Difference]: Without dead ends: 66904 [2019-12-07 10:07:59,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66904 states. [2019-12-07 10:08:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66904 to 66904. [2019-12-07 10:08:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66904 states. [2019-12-07 10:08:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66904 states to 66904 states and 260443 transitions. [2019-12-07 10:08:01,153 INFO L78 Accepts]: Start accepts. Automaton has 66904 states and 260443 transitions. Word has length 19 [2019-12-07 10:08:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,154 INFO L462 AbstractCegarLoop]: Abstraction has 66904 states and 260443 transitions. [2019-12-07 10:08:01,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 66904 states and 260443 transitions. [2019-12-07 10:08:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:08:01,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,165 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] [2019-12-07 10:08:01,165 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 10:08:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash 81142022, now seen corresponding path program 1 times [2019-12-07 10:08:01,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821038151] [2019-12-07 10:08:01,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,213 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 10:08:01,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821038151] [2019-12-07 10:08:01,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:01,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406788304] [2019-12-07 10:08:01,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:01,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,215 INFO L87 Difference]: Start difference. First operand 66904 states and 260443 transitions. Second operand 5 states. [2019-12-07 10:08:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,876 INFO L93 Difference]: Finished difference Result 80160 states and 308169 transitions. [2019-12-07 10:08:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:08:01,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:08:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,044 INFO L225 Difference]: With dead ends: 80160 [2019-12-07 10:08:02,044 INFO L226 Difference]: Without dead ends: 80108 [2019-12-07 10:08:02,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80108 states. [2019-12-07 10:08:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80108 to 66540. [2019-12-07 10:08:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66540 states. [2019-12-07 10:08:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66540 states to 66540 states and 259135 transitions. [2019-12-07 10:08:05,132 INFO L78 Accepts]: Start accepts. Automaton has 66540 states and 259135 transitions. Word has length 22 [2019-12-07 10:08:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:05,132 INFO L462 AbstractCegarLoop]: Abstraction has 66540 states and 259135 transitions. [2019-12-07 10:08:05,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 66540 states and 259135 transitions. [2019-12-07 10:08:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:08:05,193 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:05,193 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] [2019-12-07 10:08:05,193 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 10:08:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash -70807778, now seen corresponding path program 1 times [2019-12-07 10:08:05,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:05,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672874682] [2019-12-07 10:08:05,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:05,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672874682] [2019-12-07 10:08:05,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:05,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:05,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941769006] [2019-12-07 10:08:05,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:08:05,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:08:05,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:08:05,346 INFO L87 Difference]: Start difference. First operand 66540 states and 259135 transitions. Second operand 8 states. [2019-12-07 10:08:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:05,821 INFO L93 Difference]: Finished difference Result 67238 states and 261768 transitions. [2019-12-07 10:08:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:08:05,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 10:08:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:05,964 INFO L225 Difference]: With dead ends: 67238 [2019-12-07 10:08:05,964 INFO L226 Difference]: Without dead ends: 67238 [2019-12-07 10:08:05,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67238 states. [2019-12-07 10:08:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67238 to 66488. [2019-12-07 10:08:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66488 states. [2019-12-07 10:08:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66488 states to 66488 states and 258955 transitions. [2019-12-07 10:08:07,612 INFO L78 Accepts]: Start accepts. Automaton has 66488 states and 258955 transitions. Word has length 33 [2019-12-07 10:08:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:07,613 INFO L462 AbstractCegarLoop]: Abstraction has 66488 states and 258955 transitions. [2019-12-07 10:08:07,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:08:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 66488 states and 258955 transitions. [2019-12-07 10:08:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:07,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:07,670 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 10:08:07,670 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 10:08:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1087019625, now seen corresponding path program 1 times [2019-12-07 10:08:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:07,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053354238] [2019-12-07 10:08:07,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:07,730 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 10:08:07,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053354238] [2019-12-07 10:08:07,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:07,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:07,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624910009] [2019-12-07 10:08:07,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:07,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:07,732 INFO L87 Difference]: Start difference. First operand 66488 states and 258955 transitions. Second operand 5 states. [2019-12-07 10:08:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:08,187 INFO L93 Difference]: Finished difference Result 92690 states and 366351 transitions. [2019-12-07 10:08:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:08:08,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:08:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:08,580 INFO L225 Difference]: With dead ends: 92690 [2019-12-07 10:08:08,580 INFO L226 Difference]: Without dead ends: 92690 [2019-12-07 10:08:08,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92690 states. [2019-12-07 10:08:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92690 to 90168. [2019-12-07 10:08:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90168 states. [2019-12-07 10:08:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90168 states to 90168 states and 357275 transitions. [2019-12-07 10:08:10,643 INFO L78 Accepts]: Start accepts. Automaton has 90168 states and 357275 transitions. Word has length 34 [2019-12-07 10:08:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:10,644 INFO L462 AbstractCegarLoop]: Abstraction has 90168 states and 357275 transitions. [2019-12-07 10:08:10,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 90168 states and 357275 transitions. [2019-12-07 10:08:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:10,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:10,734 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 10:08:10,734 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 10:08:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2074469443, now seen corresponding path program 2 times [2019-12-07 10:08:10,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:10,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61252825] [2019-12-07 10:08:10,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:10,836 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 10:08:10,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61252825] [2019-12-07 10:08:10,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:10,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:08:10,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726233790] [2019-12-07 10:08:10,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:08:10,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:10,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:08:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:10,837 INFO L87 Difference]: Start difference. First operand 90168 states and 357275 transitions. Second operand 9 states. [2019-12-07 10:08:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:12,175 INFO L93 Difference]: Finished difference Result 172666 states and 680096 transitions. [2019-12-07 10:08:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:08:12,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 10:08:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:12,491 INFO L225 Difference]: With dead ends: 172666 [2019-12-07 10:08:12,491 INFO L226 Difference]: Without dead ends: 147240 [2019-12-07 10:08:12,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:08:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147240 states. [2019-12-07 10:08:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147240 to 114460. [2019-12-07 10:08:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114460 states. [2019-12-07 10:08:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114460 states to 114460 states and 455331 transitions. [2019-12-07 10:08:15,512 INFO L78 Accepts]: Start accepts. Automaton has 114460 states and 455331 transitions. Word has length 34 [2019-12-07 10:08:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:15,512 INFO L462 AbstractCegarLoop]: Abstraction has 114460 states and 455331 transitions. [2019-12-07 10:08:15,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:08:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 114460 states and 455331 transitions. [2019-12-07 10:08:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:15,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:15,619 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 10:08:15,619 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 10:08:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1187060215, now seen corresponding path program 3 times [2019-12-07 10:08:15,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:15,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775892784] [2019-12-07 10:08:15,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:15,666 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 10:08:15,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775892784] [2019-12-07 10:08:15,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:15,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:15,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997888061] [2019-12-07 10:08:15,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:15,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:15,668 INFO L87 Difference]: Start difference. First operand 114460 states and 455331 transitions. Second operand 4 states. [2019-12-07 10:08:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:16,394 INFO L93 Difference]: Finished difference Result 102938 states and 402148 transitions. [2019-12-07 10:08:16,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:16,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 10:08:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:16,621 INFO L225 Difference]: With dead ends: 102938 [2019-12-07 10:08:16,621 INFO L226 Difference]: Without dead ends: 102938 [2019-12-07 10:08:16,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 10:08:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102938 states. [2019-12-07 10:08:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102938 to 100826. [2019-12-07 10:08:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100826 states. [2019-12-07 10:08:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100826 states to 100826 states and 394318 transitions. [2019-12-07 10:08:19,094 INFO L78 Accepts]: Start accepts. Automaton has 100826 states and 394318 transitions. Word has length 34 [2019-12-07 10:08:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:19,094 INFO L462 AbstractCegarLoop]: Abstraction has 100826 states and 394318 transitions. [2019-12-07 10:08:19,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 100826 states and 394318 transitions. [2019-12-07 10:08:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:19,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:19,179 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 10:08:19,179 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 10:08:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1869649053, now seen corresponding path program 4 times [2019-12-07 10:08:19,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:19,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138307281] [2019-12-07 10:08:19,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:19,312 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 10:08:19,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138307281] [2019-12-07 10:08:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:08:19,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222838753] [2019-12-07 10:08:19,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:08:19,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:08:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:19,313 INFO L87 Difference]: Start difference. First operand 100826 states and 394318 transitions. Second operand 9 states. [2019-12-07 10:08:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:20,099 INFO L93 Difference]: Finished difference Result 139302 states and 547558 transitions. [2019-12-07 10:08:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:08:20,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 10:08:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:20,631 INFO L225 Difference]: With dead ends: 139302 [2019-12-07 10:08:20,631 INFO L226 Difference]: Without dead ends: 133482 [2019-12-07 10:08:20,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:08:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133482 states. [2019-12-07 10:08:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133482 to 101450. [2019-12-07 10:08:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101450 states. [2019-12-07 10:08:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101450 states to 101450 states and 396820 transitions. [2019-12-07 10:08:23,344 INFO L78 Accepts]: Start accepts. Automaton has 101450 states and 396820 transitions. Word has length 34 [2019-12-07 10:08:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 101450 states and 396820 transitions. [2019-12-07 10:08:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:08:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 101450 states and 396820 transitions. [2019-12-07 10:08:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:23,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:23,439 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 10:08:23,439 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 10:08:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2036007013, now seen corresponding path program 5 times [2019-12-07 10:08:23,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:23,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418627237] [2019-12-07 10:08:23,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:23,480 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 10:08:23,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418627237] [2019-12-07 10:08:23,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:23,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698610005] [2019-12-07 10:08:23,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:23,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:23,481 INFO L87 Difference]: Start difference. First operand 101450 states and 396820 transitions. Second operand 4 states. [2019-12-07 10:08:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:23,700 INFO L93 Difference]: Finished difference Result 59354 states and 202651 transitions. [2019-12-07 10:08:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:23,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 10:08:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:23,797 INFO L225 Difference]: With dead ends: 59354 [2019-12-07 10:08:23,797 INFO L226 Difference]: Without dead ends: 54710 [2019-12-07 10:08:23,798 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 10:08:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54710 states. [2019-12-07 10:08:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54710 to 54710. [2019-12-07 10:08:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54710 states. [2019-12-07 10:08:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54710 states to 54710 states and 186584 transitions. [2019-12-07 10:08:25,079 INFO L78 Accepts]: Start accepts. Automaton has 54710 states and 186584 transitions. Word has length 34 [2019-12-07 10:08:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:25,079 INFO L462 AbstractCegarLoop]: Abstraction has 54710 states and 186584 transitions. [2019-12-07 10:08:25,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 54710 states and 186584 transitions. [2019-12-07 10:08:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:08:25,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:25,121 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] [2019-12-07 10:08:25,121 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 10:08:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1268794360, now seen corresponding path program 1 times [2019-12-07 10:08:25,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:25,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282146085] [2019-12-07 10:08:25,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:25,173 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 10:08:25,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282146085] [2019-12-07 10:08:25,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:25,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:25,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901387268] [2019-12-07 10:08:25,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:25,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:25,174 INFO L87 Difference]: Start difference. First operand 54710 states and 186584 transitions. Second operand 5 states. [2019-12-07 10:08:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:25,536 INFO L93 Difference]: Finished difference Result 103496 states and 353389 transitions. [2019-12-07 10:08:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:25,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 10:08:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:25,631 INFO L225 Difference]: With dead ends: 103496 [2019-12-07 10:08:25,631 INFO L226 Difference]: Without dead ends: 54767 [2019-12-07 10:08:25,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 10:08:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54767 states. [2019-12-07 10:08:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54767 to 54710. [2019-12-07 10:08:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54710 states. [2019-12-07 10:08:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54710 states to 54710 states and 182717 transitions. [2019-12-07 10:08:26,750 INFO L78 Accepts]: Start accepts. Automaton has 54710 states and 182717 transitions. Word has length 35 [2019-12-07 10:08:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:26,750 INFO L462 AbstractCegarLoop]: Abstraction has 54710 states and 182717 transitions. [2019-12-07 10:08:26,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 54710 states and 182717 transitions. [2019-12-07 10:08:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:08:26,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:26,791 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] [2019-12-07 10:08:26,791 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 10:08:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1384008566, now seen corresponding path program 2 times [2019-12-07 10:08:26,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:26,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276515949] [2019-12-07 10:08:26,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:26,849 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 10:08:26,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276515949] [2019-12-07 10:08:26,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:26,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:26,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279005885] [2019-12-07 10:08:26,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:08:26,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:08:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:26,851 INFO L87 Difference]: Start difference. First operand 54710 states and 182717 transitions. Second operand 7 states. [2019-12-07 10:08:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:27,334 INFO L93 Difference]: Finished difference Result 84192 states and 283282 transitions. [2019-12-07 10:08:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:08:27,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 10:08:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:27,474 INFO L225 Difference]: With dead ends: 84192 [2019-12-07 10:08:27,474 INFO L226 Difference]: Without dead ends: 84192 [2019-12-07 10:08:27,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:08:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84192 states. [2019-12-07 10:08:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84192 to 67739. [2019-12-07 10:08:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67739 states. [2019-12-07 10:08:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67739 states to 67739 states and 227596 transitions. [2019-12-07 10:08:29,102 INFO L78 Accepts]: Start accepts. Automaton has 67739 states and 227596 transitions. Word has length 35 [2019-12-07 10:08:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:29,103 INFO L462 AbstractCegarLoop]: Abstraction has 67739 states and 227596 transitions. [2019-12-07 10:08:29,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:08:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 67739 states and 227596 transitions. [2019-12-07 10:08:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:08:29,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:29,151 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] [2019-12-07 10:08:29,151 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 10:08:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1915115436, now seen corresponding path program 3 times [2019-12-07 10:08:29,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:29,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18029769] [2019-12-07 10:08:29,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:29,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18029769] [2019-12-07 10:08:29,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:29,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:29,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692397331] [2019-12-07 10:08:29,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:29,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:29,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:29,200 INFO L87 Difference]: Start difference. First operand 67739 states and 227596 transitions. Second operand 5 states. [2019-12-07 10:08:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:29,247 INFO L93 Difference]: Finished difference Result 8835 states and 23791 transitions. [2019-12-07 10:08:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:29,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 10:08:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:29,253 INFO L225 Difference]: With dead ends: 8835 [2019-12-07 10:08:29,253 INFO L226 Difference]: Without dead ends: 6374 [2019-12-07 10:08:29,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6374 states. [2019-12-07 10:08:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6374 to 6362. [2019-12-07 10:08:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-12-07 10:08:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 15491 transitions. [2019-12-07 10:08:29,314 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 15491 transitions. Word has length 35 [2019-12-07 10:08:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:29,314 INFO L462 AbstractCegarLoop]: Abstraction has 6362 states and 15491 transitions. [2019-12-07 10:08:29,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 15491 transitions. [2019-12-07 10:08:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:08:29,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:29,317 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] [2019-12-07 10:08:29,317 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 10:08:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:29,318 INFO L82 PathProgramCache]: Analyzing trace with hash -244656218, now seen corresponding path program 1 times [2019-12-07 10:08:29,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:29,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981174823] [2019-12-07 10:08:29,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:29,370 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 10:08:29,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981174823] [2019-12-07 10:08:29,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:29,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:29,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345056210] [2019-12-07 10:08:29,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:29,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:29,371 INFO L87 Difference]: Start difference. First operand 6362 states and 15491 transitions. Second operand 6 states. [2019-12-07 10:08:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:29,416 INFO L93 Difference]: Finished difference Result 4894 states and 12151 transitions. [2019-12-07 10:08:29,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:29,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 10:08:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:29,418 INFO L225 Difference]: With dead ends: 4894 [2019-12-07 10:08:29,418 INFO L226 Difference]: Without dead ends: 2439 [2019-12-07 10:08:29,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2019-12-07 10:08:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2427. [2019-12-07 10:08:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2427 states. [2019-12-07 10:08:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5997 transitions. [2019-12-07 10:08:29,439 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5997 transitions. Word has length 47 [2019-12-07 10:08:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:29,440 INFO L462 AbstractCegarLoop]: Abstraction has 2427 states and 5997 transitions. [2019-12-07 10:08:29,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5997 transitions. [2019-12-07 10:08:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:08:29,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:29,441 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 10:08:29,441 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 10:08:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1430430823, now seen corresponding path program 1 times [2019-12-07 10:08:29,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:29,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859016997] [2019-12-07 10:08:29,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:29,649 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 10:08:29,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859016997] [2019-12-07 10:08:29,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:29,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:08:29,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462310492] [2019-12-07 10:08:29,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:08:29,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:08:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:29,650 INFO L87 Difference]: Start difference. First operand 2427 states and 5997 transitions. Second operand 9 states. [2019-12-07 10:08:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:30,352 INFO L93 Difference]: Finished difference Result 5391 states and 13244 transitions. [2019-12-07 10:08:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:30,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 10:08:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:30,357 INFO L225 Difference]: With dead ends: 5391 [2019-12-07 10:08:30,357 INFO L226 Difference]: Without dead ends: 5291 [2019-12-07 10:08:30,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:08:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2019-12-07 10:08:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 3763. [2019-12-07 10:08:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-12-07 10:08:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 9481 transitions. [2019-12-07 10:08:30,400 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 9481 transitions. Word has length 62 [2019-12-07 10:08:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:30,400 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 9481 transitions. [2019-12-07 10:08:30,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:08:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 9481 transitions. [2019-12-07 10:08:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:08:30,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:30,403 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 10:08:30,403 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 10:08:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1949728745, now seen corresponding path program 2 times [2019-12-07 10:08:30,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:30,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047010631] [2019-12-07 10:08:30,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:30,445 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 10:08:30,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047010631] [2019-12-07 10:08:30,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:30,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:30,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210460782] [2019-12-07 10:08:30,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:30,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:30,447 INFO L87 Difference]: Start difference. First operand 3763 states and 9481 transitions. Second operand 6 states. [2019-12-07 10:08:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:30,543 INFO L93 Difference]: Finished difference Result 7182 states and 18168 transitions. [2019-12-07 10:08:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:08:30,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 10:08:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:30,550 INFO L225 Difference]: With dead ends: 7182 [2019-12-07 10:08:30,550 INFO L226 Difference]: Without dead ends: 6265 [2019-12-07 10:08:30,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:08:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2019-12-07 10:08:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 5421. [2019-12-07 10:08:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-07 10:08:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 13904 transitions. [2019-12-07 10:08:30,608 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 13904 transitions. Word has length 62 [2019-12-07 10:08:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:30,608 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 13904 transitions. [2019-12-07 10:08:30,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 13904 transitions. [2019-12-07 10:08:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:08:30,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:30,611 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 10:08:30,611 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 10:08:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1330985147, now seen corresponding path program 3 times [2019-12-07 10:08:30,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:30,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050867512] [2019-12-07 10:08:30,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:30,813 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 10:08:30,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050867512] [2019-12-07 10:08:30,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:30,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:08:30,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085216815] [2019-12-07 10:08:30,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:08:30,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:08:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:30,814 INFO L87 Difference]: Start difference. First operand 5421 states and 13904 transitions. Second operand 9 states. [2019-12-07 10:08:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:32,213 INFO L93 Difference]: Finished difference Result 8059 states and 19926 transitions. [2019-12-07 10:08:32,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:08:32,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 10:08:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:32,217 INFO L225 Difference]: With dead ends: 8059 [2019-12-07 10:08:32,217 INFO L226 Difference]: Without dead ends: 5856 [2019-12-07 10:08:32,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:08:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2019-12-07 10:08:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 2789. [2019-12-07 10:08:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-12-07 10:08:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 6907 transitions. [2019-12-07 10:08:32,255 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 6907 transitions. Word has length 62 [2019-12-07 10:08:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:32,256 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 6907 transitions. [2019-12-07 10:08:32,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:08:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 6907 transitions. [2019-12-07 10:08:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:08:32,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:32,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:08:32,257 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 10:08:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash 742159584, now seen corresponding path program 1 times [2019-12-07 10:08:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:32,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572548617] [2019-12-07 10:08:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:32,327 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 10:08:32,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572548617] [2019-12-07 10:08:32,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:32,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:08:32,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420072108] [2019-12-07 10:08:32,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:08:32,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:08:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:08:32,329 INFO L87 Difference]: Start difference. First operand 2789 states and 6907 transitions. Second operand 8 states. [2019-12-07 10:08:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:32,567 INFO L93 Difference]: Finished difference Result 6103 states and 14828 transitions. [2019-12-07 10:08:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:08:32,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 10:08:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:32,572 INFO L225 Difference]: With dead ends: 6103 [2019-12-07 10:08:32,572 INFO L226 Difference]: Without dead ends: 5318 [2019-12-07 10:08:32,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:08:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-12-07 10:08:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4250. [2019-12-07 10:08:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4250 states. [2019-12-07 10:08:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 10712 transitions. [2019-12-07 10:08:32,619 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 10712 transitions. Word has length 63 [2019-12-07 10:08:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:32,619 INFO L462 AbstractCegarLoop]: Abstraction has 4250 states and 10712 transitions. [2019-12-07 10:08:32,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:08:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 10712 transitions. [2019-12-07 10:08:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:08:32,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:32,622 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 10:08:32,622 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 10:08:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash -250797522, now seen corresponding path program 2 times [2019-12-07 10:08:32,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:32,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160917854] [2019-12-07 10:08:32,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:32,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:08:32,686 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:08:32,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t278~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p0_EAX~0_101) (= |v_ULTIMATE.start_main_~#t278~0.offset_66| 0) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= v_~__unbuffered_cnt~0_161 0) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_#valid_150| (store .cse0 |v_ULTIMATE.start_main_~#t278~0.base_119| 1)) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_119|) |v_ULTIMATE.start_main_~#t278~0.offset_66| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t278~0.base_119|)) (= v_~z$r_buff1_thd2~0_453 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t278~0.base_119|) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_91|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_39|, ULTIMATE.start_main_~#t278~0.offset=|v_ULTIMATE.start_main_~#t278~0.offset_66|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_~#t278~0.base=|v_ULTIMATE.start_main_~#t278~0.base_119|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_66|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t278~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t278~0.base, 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, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t280~0.base, ~__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_~#t279~0.offset] because there is no mapped edge [2019-12-07 10:08:32,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11|) |v_ULTIMATE.start_main_~#t279~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_ULTIMATE.start_main_~#t279~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t279~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t279~0.base_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t279~0.offset] because there is no mapped edge [2019-12-07 10:08:32,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t280~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) |v_ULTIMATE.start_main_~#t280~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t280~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t280~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_8|, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t280~0.base] because there is no mapped edge [2019-12-07 10:08:32,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:08:32,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1733910699 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1733910699 256) 0))) (or (and (= ~z$w_buff1~0_In1733910699 |P2Thread1of1ForFork0_#t~ite28_Out1733910699|) (or .cse0 .cse1)) (and (= ~z$w_buff0~0_In1733910699 |P2Thread1of1ForFork0_#t~ite28_Out1733910699|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1733910699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733910699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1733910699, ~z$w_buff1~0=~z$w_buff1~0_In1733910699} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1733910699|, ~z$w_buff0~0=~z$w_buff0~0_In1733910699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733910699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1733910699, ~z$w_buff1~0=~z$w_buff1~0_In1733910699} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:08:32,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:32,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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 10:08:32,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In2081555621 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out2081555621| ~z~0_In2081555621)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out2081555621| ~z$mem_tmp~0_In2081555621) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2081555621, ~z$flush_delayed~0=~z$flush_delayed~0_In2081555621, ~z~0=~z~0_In2081555621} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out2081555621|, ~z$mem_tmp~0=~z$mem_tmp~0_In2081555621, ~z$flush_delayed~0=~z$flush_delayed~0_In2081555621, ~z~0=~z~0_In2081555621} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:08:32,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:08:32,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1978427780 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1978427780 256)))) (or (and (= ~z$w_buff0_used~0_In1978427780 |P2Thread1of1ForFork0_#t~ite51_Out1978427780|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1978427780|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1978427780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1978427780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1978427780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1978427780, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1978427780|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:08:32,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1286166015 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1286166015 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1286166015 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1286166015 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1286166015| 0)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1286166015| ~z$w_buff1_used~0_In1286166015) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1286166015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1286166015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286166015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286166015} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1286166015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1286166015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286166015, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1286166015|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286166015} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:08:32,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-457220767 256) 0)) (.cse0 (= ~z$r_buff0_thd3~0_Out-457220767 ~z$r_buff0_thd3~0_In-457220767)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-457220767 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd3~0_Out-457220767 0)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-457220767, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457220767} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-457220767, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-457220767, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-457220767|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:08:32,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1042937852 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1042937852 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1042937852 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1042937852 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1042937852 |P2Thread1of1ForFork0_#t~ite54_Out1042937852|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1042937852| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1042937852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042937852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042937852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1042937852} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1042937852, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1042937852|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042937852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042937852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1042937852} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:08:32,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, 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 10:08:32,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In712050203 256)))) (or (and (= ~z$mem_tmp~0_In712050203 |P1Thread1of1ForFork2_#t~ite25_Out712050203|) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out712050203| ~z~0_In712050203) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In712050203, ~z$flush_delayed~0=~z$flush_delayed~0_In712050203, ~z~0=~z~0_In712050203} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In712050203, ~z$flush_delayed~0=~z$flush_delayed~0_In712050203, ~z~0=~z~0_In712050203, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out712050203|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:08:32,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} 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 10:08:32,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:08:32,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-136939027 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-136939027 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-136939027| |ULTIMATE.start_main_#t~ite59_Out-136939027|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-136939027| ~z~0_In-136939027) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-136939027| ~z$w_buff1~0_In-136939027) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-136939027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136939027, ~z$w_buff1~0=~z$w_buff1~0_In-136939027, ~z~0=~z~0_In-136939027} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-136939027, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-136939027|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136939027, ~z$w_buff1~0=~z$w_buff1~0_In-136939027, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-136939027|, ~z~0=~z~0_In-136939027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:08:32,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1881336340 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1881336340 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1881336340| 0)) (and (= ~z$w_buff0_used~0_In-1881336340 |ULTIMATE.start_main_#t~ite60_Out-1881336340|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1881336340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1881336340} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1881336340|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1881336340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1881336340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:08:32,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1951737780 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1951737780 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1951737780 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1951737780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1951737780|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1951737780 |ULTIMATE.start_main_#t~ite61_Out1951737780|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1951737780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951737780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1951737780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951737780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1951737780, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1951737780|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951737780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1951737780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951737780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:08:32,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1948968788 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1948968788 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1948968788| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1948968788| ~z$r_buff0_thd0~0_In-1948968788) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948968788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948968788} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1948968788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948968788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948968788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:08:32,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-891627623 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-891627623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-891627623 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-891627623 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-891627623|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-891627623 |ULTIMATE.start_main_#t~ite63_Out-891627623|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-891627623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-891627623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-891627623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-891627623} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-891627623|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-891627623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-891627623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-891627623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-891627623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:08:32,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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 10:08:32,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:32 BasicIcfg [2019-12-07 10:08:32,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:32,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:32,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:32,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:32,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:37" (3/4) ... [2019-12-07 10:08:32,770 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:08:32,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t278~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p0_EAX~0_101) (= |v_ULTIMATE.start_main_~#t278~0.offset_66| 0) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= v_~__unbuffered_cnt~0_161 0) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_#valid_150| (store .cse0 |v_ULTIMATE.start_main_~#t278~0.base_119| 1)) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_119|) |v_ULTIMATE.start_main_~#t278~0.offset_66| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t278~0.base_119|)) (= v_~z$r_buff1_thd2~0_453 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t278~0.base_119|) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_91|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_39|, ULTIMATE.start_main_~#t278~0.offset=|v_ULTIMATE.start_main_~#t278~0.offset_66|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_~#t278~0.base=|v_ULTIMATE.start_main_~#t278~0.base_119|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_66|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_39|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t278~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t278~0.base, 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, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t280~0.base, ~__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_~#t279~0.offset] because there is no mapped edge [2019-12-07 10:08:32,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11|) |v_ULTIMATE.start_main_~#t279~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_ULTIMATE.start_main_~#t279~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t279~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t279~0.base_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t279~0.offset] because there is no mapped edge [2019-12-07 10:08:32,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t280~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) |v_ULTIMATE.start_main_~#t280~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t280~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t280~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_8|, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t280~0.base] because there is no mapped edge [2019-12-07 10:08:32,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:08:32,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1733910699 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1733910699 256) 0))) (or (and (= ~z$w_buff1~0_In1733910699 |P2Thread1of1ForFork0_#t~ite28_Out1733910699|) (or .cse0 .cse1)) (and (= ~z$w_buff0~0_In1733910699 |P2Thread1of1ForFork0_#t~ite28_Out1733910699|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1733910699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733910699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1733910699, ~z$w_buff1~0=~z$w_buff1~0_In1733910699} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1733910699|, ~z$w_buff0~0=~z$w_buff0~0_In1733910699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1733910699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1733910699, ~z$w_buff1~0=~z$w_buff1~0_In1733910699} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:08:32,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} 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 10:08:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In2081555621 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out2081555621| ~z~0_In2081555621)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out2081555621| ~z$mem_tmp~0_In2081555621) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2081555621, ~z$flush_delayed~0=~z$flush_delayed~0_In2081555621, ~z~0=~z~0_In2081555621} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out2081555621|, ~z$mem_tmp~0=~z$mem_tmp~0_In2081555621, ~z$flush_delayed~0=~z$flush_delayed~0_In2081555621, ~z~0=~z~0_In2081555621} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:08:32,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:08:32,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1978427780 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1978427780 256)))) (or (and (= ~z$w_buff0_used~0_In1978427780 |P2Thread1of1ForFork0_#t~ite51_Out1978427780|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1978427780|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1978427780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1978427780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1978427780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1978427780, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1978427780|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:08:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1286166015 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1286166015 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1286166015 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1286166015 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1286166015| 0)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1286166015| ~z$w_buff1_used~0_In1286166015) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1286166015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1286166015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286166015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286166015} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1286166015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1286166015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286166015, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1286166015|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286166015} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:08:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-457220767 256) 0)) (.cse0 (= ~z$r_buff0_thd3~0_Out-457220767 ~z$r_buff0_thd3~0_In-457220767)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-457220767 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd3~0_Out-457220767 0)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-457220767, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457220767} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-457220767, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-457220767, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-457220767|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:08:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1042937852 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1042937852 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1042937852 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1042937852 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1042937852 |P2Thread1of1ForFork0_#t~ite54_Out1042937852|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1042937852| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1042937852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042937852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042937852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1042937852} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1042937852, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1042937852|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042937852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042937852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1042937852} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:08:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, 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 10:08:32,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In712050203 256)))) (or (and (= ~z$mem_tmp~0_In712050203 |P1Thread1of1ForFork2_#t~ite25_Out712050203|) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out712050203| ~z~0_In712050203) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In712050203, ~z$flush_delayed~0=~z$flush_delayed~0_In712050203, ~z~0=~z~0_In712050203} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In712050203, ~z$flush_delayed~0=~z$flush_delayed~0_In712050203, ~z~0=~z~0_In712050203, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out712050203|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:08:32,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} 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 10:08:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:08:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-136939027 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-136939027 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-136939027| |ULTIMATE.start_main_#t~ite59_Out-136939027|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out-136939027| ~z~0_In-136939027) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-136939027| ~z$w_buff1~0_In-136939027) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-136939027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136939027, ~z$w_buff1~0=~z$w_buff1~0_In-136939027, ~z~0=~z~0_In-136939027} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-136939027, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-136939027|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136939027, ~z$w_buff1~0=~z$w_buff1~0_In-136939027, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-136939027|, ~z~0=~z~0_In-136939027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:08:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1881336340 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1881336340 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1881336340| 0)) (and (= ~z$w_buff0_used~0_In-1881336340 |ULTIMATE.start_main_#t~ite60_Out-1881336340|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1881336340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1881336340} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1881336340|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1881336340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1881336340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:08:32,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1951737780 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1951737780 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1951737780 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1951737780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1951737780|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1951737780 |ULTIMATE.start_main_#t~ite61_Out1951737780|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1951737780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951737780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1951737780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951737780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1951737780, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1951737780|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1951737780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1951737780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951737780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:08:32,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1948968788 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1948968788 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1948968788| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1948968788| ~z$r_buff0_thd0~0_In-1948968788) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948968788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948968788} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1948968788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1948968788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1948968788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:08:32,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-891627623 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-891627623 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-891627623 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-891627623 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-891627623|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-891627623 |ULTIMATE.start_main_#t~ite63_Out-891627623|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-891627623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-891627623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-891627623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-891627623} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-891627623|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-891627623, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-891627623, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-891627623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-891627623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:08:32,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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 10:08:32,846 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b186641d-0086-4713-b9f7-006946a56c02/bin/uautomizer/witness.graphml [2019-12-07 10:08:32,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:32,847 INFO L168 Benchmark]: Toolchain (without parser) took 55860.94 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 938.2 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,847 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:32,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.94 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 10:08:32,848 INFO L168 Benchmark]: Boogie Preprocessor took 26.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,848 INFO L168 Benchmark]: RCFGBuilder took 445.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,848 INFO L168 Benchmark]: TraceAbstraction took 54859.38 ms. Allocated memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 984.9 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,849 INFO L168 Benchmark]: Witness Printer took 78.36 ms. Allocated memory is still 5.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:32,850 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.94 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.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 445.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.9 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54859.38 ms. Allocated memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 984.9 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 78.36 ms. Allocated memory is still 5.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 28 ChoiceCompositions, 9334 VarBasedMoverChecksPositive, 325 VarBasedMoverChecksNegative, 95 SemBasedMoverChecksPositive, 334 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 138188 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t278, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L842] FCALL, FORK 0 pthread_create(&t279, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L844] FCALL, FORK 0 pthread_create(&t280, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, 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] [L802] 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_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=7, 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] [L803] 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_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=7, 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] [L803] 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)) [L804] 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_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=7, 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] [L804] 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)) [L805] 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_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=7, 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] [L805] 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)) [L806] 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_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=7, 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] [L806] 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)) [L808] 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_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=7, 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$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)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, 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 = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, 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] [L817] 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_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=7, 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] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=8, 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] [L765] 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=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=8, 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] [L817] 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) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 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) [L819] 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 [L766] 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=2, __unbuffered_p0_EAX=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=8, 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] [L766] 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)) [L767] 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=2, __unbuffered_p0_EAX=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=8, 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] [L767] 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)) [L768] 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=2, __unbuffered_p0_EAX=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=8, 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] [L768] 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)) [L769] 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=2, __unbuffered_p0_EAX=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=8, 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] [L769] 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)) [L770] 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=2, __unbuffered_p0_EAX=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=8, 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] [L770] 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)) [L771] 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=2, __unbuffered_p0_EAX=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=8, 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] [L771] 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)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=8, 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] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=8, 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] [L850] 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) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 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 [L853] 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 54.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5058 SDtfs, 7372 SDslu, 12828 SDs, 0 SdLazy, 4664 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114460occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 117556 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 696 ConstructedInterpolants, 0 QuantifiedInterpolants, 206964 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...