./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.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_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/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 53fb212e5d3c8b8515adeaa8c75624fee39c7d13 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:04:28,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:04:28,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:04:28,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:04:28,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:04:28,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:04:28,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:04:28,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:04:28,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:04:28,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:04:28,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:04:28,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:04:28,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:04:28,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:04:28,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:04:28,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:04:28,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:04:28,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:04:28,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:04:28,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:04:28,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:04:28,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:04:28,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:04:28,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:04:28,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:04:28,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:04:28,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:04:28,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:04:28,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:04:28,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:04:28,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:04:28,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:04:28,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:04:28,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:04:28,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:04:28,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:04:28,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:04:28,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:04:28,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:04:28,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:04:28,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:04:28,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:04:28,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:04:28,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:04:28,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:04:28,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:04:28,204 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:04:28,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:04:28,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:04:28,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:04:28,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:04:28,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:04:28,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:04:28,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:04:28,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:04:28,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:04:28,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:04:28,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:04:28,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:04:28,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:04:28,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:04:28,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/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 -> 53fb212e5d3c8b8515adeaa8c75624fee39c7d13 [2019-12-07 18:04:28,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:04:28,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:04:28,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:04:28,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:04:28,343 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:04:28,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i [2019-12-07 18:04:28,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/data/8a81d3958/235116c674e44b029c183025bb9fb895/FLAG2b40babc6 [2019-12-07 18:04:28,899 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:04:28,900 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i [2019-12-07 18:04:28,913 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/data/8a81d3958/235116c674e44b029c183025bb9fb895/FLAG2b40babc6 [2019-12-07 18:04:29,416 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/data/8a81d3958/235116c674e44b029c183025bb9fb895 [2019-12-07 18:04:29,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:04:29,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:04:29,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:04:29,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:04:29,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:04:29,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29, skipping insertion in model container [2019-12-07 18:04:29,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:04:29,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:04:29,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:04:29,724 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:04:29,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:04:29,814 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:04:29,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29 WrapperNode [2019-12-07 18:04:29,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:04:29,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:04:29,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:04:29,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:04:29,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:04:29,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:04:29,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:04:29,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:04:29,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... [2019-12-07 18:04:29,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:04:29,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:04:29,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:04:29,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:04:29,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/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 18:04:29,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:04:29,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:04:29,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:04:29,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:04:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:04:29,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:04:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:04:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:04:29,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:04:29,924 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 18:04:30,283 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:04:30,283 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:04:30,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:30 BoogieIcfgContainer [2019-12-07 18:04:30,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:04:30,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:04:30,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:04:30,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:04:30,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:04:29" (1/3) ... [2019-12-07 18:04:30,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:04:30, skipping insertion in model container [2019-12-07 18:04:30,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:29" (2/3) ... [2019-12-07 18:04:30,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:04:30, skipping insertion in model container [2019-12-07 18:04:30,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:30" (3/3) ... [2019-12-07 18:04:30,288 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-07 18:04:30,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:04:30,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:04:30,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:04:30,300 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:04:30,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:04:30,356 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:04:30,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:04:30,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:04:30,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:04:30,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:04:30,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:04:30,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:04:30,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:04:30,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:04:30,380 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-07 18:04:30,381 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 18:04:30,435 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 18:04:30,435 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:04:30,445 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 18:04:30,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 18:04:30,491 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 18:04:30,491 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:04:30,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 18:04:30,512 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 18:04:30,513 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:04:33,744 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:04:33,919 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:04:34,023 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-07 18:04:34,023 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 18:04:34,025 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-07 18:04:58,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-07 18:04:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-07 18:04:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:04:59,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:59,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:59,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-07 18:04:59,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:59,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305433787] [2019-12-07 18:04:59,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:59,160 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 18:04:59,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305433787] [2019-12-07 18:04:59,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:59,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:04:59,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023766003] [2019-12-07 18:04:59,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:04:59,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:59,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:04:59,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:59,175 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-07 18:05:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:00,196 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-07 18:05:00,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:00,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:05:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:00,844 INFO L225 Difference]: With dead ends: 152486 [2019-12-07 18:05:00,844 INFO L226 Difference]: Without dead ends: 143750 [2019-12-07 18:05:00,845 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 18:05:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-07 18:05:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-07 18:05:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-07 18:05:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-07 18:05:09,772 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-07 18:05:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:09,773 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-07 18:05:09,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:05:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-07 18:05:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:05:09,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:09,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:09,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-07 18:05:09,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:09,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539974819] [2019-12-07 18:05:09,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:09,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 18:05:09,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539974819] [2019-12-07 18:05:09,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:09,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:05:09,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190346458] [2019-12-07 18:05:09,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:09,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:09,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:09,852 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-07 18:05:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:11,187 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-07 18:05:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:05:11,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:05:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:11,883 INFO L225 Difference]: With dead ends: 226574 [2019-12-07 18:05:11,883 INFO L226 Difference]: Without dead ends: 226406 [2019-12-07 18:05:11,883 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 18:05:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-07 18:05:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-07 18:05:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-07 18:05:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-07 18:05:24,023 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-07 18:05:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:24,023 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-07 18:05:24,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-07 18:05:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:05:24,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:24,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:24,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-07 18:05:24,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:24,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127660894] [2019-12-07 18:05:24,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:24,077 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 18:05:24,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127660894] [2019-12-07 18:05:24,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:24,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:05:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032985700] [2019-12-07 18:05:24,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:24,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:24,078 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 4 states. [2019-12-07 18:05:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:25,737 INFO L93 Difference]: Finished difference Result 290690 states and 1317990 transitions. [2019-12-07 18:05:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:05:25,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:05:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:27,364 INFO L225 Difference]: With dead ends: 290690 [2019-12-07 18:05:27,364 INFO L226 Difference]: Without dead ends: 290498 [2019-12-07 18:05:27,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290498 states. [2019-12-07 18:05:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290498 to 247334. [2019-12-07 18:05:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247334 states. [2019-12-07 18:05:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247334 states to 247334 states and 1137054 transitions. [2019-12-07 18:05:42,073 INFO L78 Accepts]: Start accepts. Automaton has 247334 states and 1137054 transitions. Word has length 15 [2019-12-07 18:05:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:42,073 INFO L462 AbstractCegarLoop]: Abstraction has 247334 states and 1137054 transitions. [2019-12-07 18:05:42,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 247334 states and 1137054 transitions. [2019-12-07 18:05:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:05:42,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:42,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:42,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-07 18:05:42,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:42,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384027541] [2019-12-07 18:05:42,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:42,139 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 18:05:42,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384027541] [2019-12-07 18:05:42,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:42,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:05:42,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769898781] [2019-12-07 18:05:42,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:05:42,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:05:42,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:05:42,141 INFO L87 Difference]: Start difference. First operand 247334 states and 1137054 transitions. Second operand 5 states. [2019-12-07 18:05:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:44,572 INFO L93 Difference]: Finished difference Result 335030 states and 1515532 transitions. [2019-12-07 18:05:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:05:44,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:05:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:45,556 INFO L225 Difference]: With dead ends: 335030 [2019-12-07 18:05:45,556 INFO L226 Difference]: Without dead ends: 334758 [2019-12-07 18:05:45,556 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 18:05:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334758 states. [2019-12-07 18:05:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334758 to 261640. [2019-12-07 18:05:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261640 states. [2019-12-07 18:06:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261640 states to 261640 states and 1201383 transitions. [2019-12-07 18:06:00,857 INFO L78 Accepts]: Start accepts. Automaton has 261640 states and 1201383 transitions. Word has length 16 [2019-12-07 18:06:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 261640 states and 1201383 transitions. [2019-12-07 18:06:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:06:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 261640 states and 1201383 transitions. [2019-12-07 18:06:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:06:00,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:00,887 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] [2019-12-07 18:06:00,887 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash -590847212, now seen corresponding path program 1 times [2019-12-07 18:06:00,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:00,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897094611] [2019-12-07 18:06:00,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:00,950 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 18:06:00,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897094611] [2019-12-07 18:06:00,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:00,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:06:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115544332] [2019-12-07 18:06:00,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:00,952 INFO L87 Difference]: Start difference. First operand 261640 states and 1201383 transitions. Second operand 3 states. [2019-12-07 18:06:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:02,774 INFO L93 Difference]: Finished difference Result 246888 states and 1122565 transitions. [2019-12-07 18:06:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:02,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:06:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:03,486 INFO L225 Difference]: With dead ends: 246888 [2019-12-07 18:06:03,486 INFO L226 Difference]: Without dead ends: 246888 [2019-12-07 18:06:03,486 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 18:06:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246888 states. [2019-12-07 18:06:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246888 to 243128. [2019-12-07 18:06:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243128 states. [2019-12-07 18:06:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243128 states to 243128 states and 1106381 transitions. [2019-12-07 18:06:17,626 INFO L78 Accepts]: Start accepts. Automaton has 243128 states and 1106381 transitions. Word has length 20 [2019-12-07 18:06:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:17,626 INFO L462 AbstractCegarLoop]: Abstraction has 243128 states and 1106381 transitions. [2019-12-07 18:06:17,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 243128 states and 1106381 transitions. [2019-12-07 18:06:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:06:17,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:17,642 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] [2019-12-07 18:06:17,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597908, now seen corresponding path program 1 times [2019-12-07 18:06:17,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:17,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623028816] [2019-12-07 18:06:17,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:17,693 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 18:06:17,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623028816] [2019-12-07 18:06:17,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:17,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:06:17,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113441517] [2019-12-07 18:06:17,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:06:17,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:06:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:06:17,694 INFO L87 Difference]: Start difference. First operand 243128 states and 1106381 transitions. Second operand 3 states. [2019-12-07 18:06:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:20,249 INFO L93 Difference]: Finished difference Result 422040 states and 1897830 transitions. [2019-12-07 18:06:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:06:20,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:06:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:21,503 INFO L225 Difference]: With dead ends: 422040 [2019-12-07 18:06:21,503 INFO L226 Difference]: Without dead ends: 414536 [2019-12-07 18:06:21,503 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 18:06:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414536 states. [2019-12-07 18:06:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414536 to 399396. [2019-12-07 18:06:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399396 states. [2019-12-07 18:06:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399396 states to 399396 states and 1813434 transitions. [2019-12-07 18:06:40,837 INFO L78 Accepts]: Start accepts. Automaton has 399396 states and 1813434 transitions. Word has length 20 [2019-12-07 18:06:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:40,837 INFO L462 AbstractCegarLoop]: Abstraction has 399396 states and 1813434 transitions. [2019-12-07 18:06:40,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:06:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 399396 states and 1813434 transitions. [2019-12-07 18:06:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:06:40,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:40,869 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] [2019-12-07 18:06:40,870 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1169391876, now seen corresponding path program 1 times [2019-12-07 18:06:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818758743] [2019-12-07 18:06:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:40,928 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 18:06:40,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818758743] [2019-12-07 18:06:40,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:40,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:06:40,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206768250] [2019-12-07 18:06:40,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:06:40,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:06:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:06:40,929 INFO L87 Difference]: Start difference. First operand 399396 states and 1813434 transitions. Second operand 4 states. [2019-12-07 18:06:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:43,579 INFO L93 Difference]: Finished difference Result 412730 states and 1860443 transitions. [2019-12-07 18:06:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:06:43,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:06:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:44,809 INFO L225 Difference]: With dead ends: 412730 [2019-12-07 18:06:44,809 INFO L226 Difference]: Without dead ends: 412730 [2019-12-07 18:06:44,809 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 18:06:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412730 states. [2019-12-07 18:07:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412730 to 389970. [2019-12-07 18:07:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389970 states. [2019-12-07 18:07:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389970 states to 389970 states and 1774788 transitions. [2019-12-07 18:07:04,546 INFO L78 Accepts]: Start accepts. Automaton has 389970 states and 1774788 transitions. Word has length 21 [2019-12-07 18:07:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:04,547 INFO L462 AbstractCegarLoop]: Abstraction has 389970 states and 1774788 transitions. [2019-12-07 18:07:04,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 389970 states and 1774788 transitions. [2019-12-07 18:07:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:07:04,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:04,580 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] [2019-12-07 18:07:04,580 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1490679915, now seen corresponding path program 1 times [2019-12-07 18:07:04,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:04,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805209729] [2019-12-07 18:07:04,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:04,624 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 18:07:04,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805209729] [2019-12-07 18:07:04,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:04,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:04,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812403563] [2019-12-07 18:07:04,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:04,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:04,626 INFO L87 Difference]: Start difference. First operand 389970 states and 1774788 transitions. Second operand 5 states. [2019-12-07 18:07:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:08,239 INFO L93 Difference]: Finished difference Result 543844 states and 2433642 transitions. [2019-12-07 18:07:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:07:08,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 18:07:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:10,399 INFO L225 Difference]: With dead ends: 543844 [2019-12-07 18:07:10,399 INFO L226 Difference]: Without dead ends: 543520 [2019-12-07 18:07:10,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 18:07:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543520 states. [2019-12-07 18:07:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543520 to 409778. [2019-12-07 18:07:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409778 states. [2019-12-07 18:07:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409778 states to 409778 states and 1861833 transitions. [2019-12-07 18:07:32,974 INFO L78 Accepts]: Start accepts. Automaton has 409778 states and 1861833 transitions. Word has length 21 [2019-12-07 18:07:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:32,975 INFO L462 AbstractCegarLoop]: Abstraction has 409778 states and 1861833 transitions. [2019-12-07 18:07:32,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 409778 states and 1861833 transitions. [2019-12-07 18:07:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:07:33,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:33,008 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] [2019-12-07 18:07:33,008 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash 543915511, now seen corresponding path program 1 times [2019-12-07 18:07:33,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:33,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521131053] [2019-12-07 18:07:33,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:33,031 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 18:07:33,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521131053] [2019-12-07 18:07:33,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:33,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:33,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377437523] [2019-12-07 18:07:33,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:33,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:33,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:33,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:33,033 INFO L87 Difference]: Start difference. First operand 409778 states and 1861833 transitions. Second operand 3 states. [2019-12-07 18:07:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:34,178 INFO L93 Difference]: Finished difference Result 252695 states and 1033374 transitions. [2019-12-07 18:07:34,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:34,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:07:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:35,569 INFO L225 Difference]: With dead ends: 252695 [2019-12-07 18:07:35,569 INFO L226 Difference]: Without dead ends: 252695 [2019-12-07 18:07:35,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252695 states. [2019-12-07 18:07:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252695 to 252695. [2019-12-07 18:07:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252695 states. [2019-12-07 18:07:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252695 states to 252695 states and 1033374 transitions. [2019-12-07 18:07:44,092 INFO L78 Accepts]: Start accepts. Automaton has 252695 states and 1033374 transitions. Word has length 21 [2019-12-07 18:07:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,092 INFO L462 AbstractCegarLoop]: Abstraction has 252695 states and 1033374 transitions. [2019-12-07 18:07:44,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 252695 states and 1033374 transitions. [2019-12-07 18:07:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:07:44,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,112 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 18:07:44,112 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2129291057, now seen corresponding path program 1 times [2019-12-07 18:07:44,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166546421] [2019-12-07 18:07:44,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,143 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 18:07:44,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166546421] [2019-12-07 18:07:44,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:44,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533995767] [2019-12-07 18:07:44,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:44,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:44,144 INFO L87 Difference]: Start difference. First operand 252695 states and 1033374 transitions. Second operand 4 states. [2019-12-07 18:07:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:49,305 INFO L93 Difference]: Finished difference Result 417224 states and 1701185 transitions. [2019-12-07 18:07:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:49,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 18:07:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:49,931 INFO L225 Difference]: With dead ends: 417224 [2019-12-07 18:07:49,932 INFO L226 Difference]: Without dead ends: 239431 [2019-12-07 18:07:49,932 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 18:07:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239431 states. [2019-12-07 18:07:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239431 to 238906. [2019-12-07 18:07:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238906 states. [2019-12-07 18:07:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238906 states to 238906 states and 971586 transitions. [2019-12-07 18:07:57,742 INFO L78 Accepts]: Start accepts. Automaton has 238906 states and 971586 transitions. Word has length 22 [2019-12-07 18:07:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:57,742 INFO L462 AbstractCegarLoop]: Abstraction has 238906 states and 971586 transitions. [2019-12-07 18:07:57,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 238906 states and 971586 transitions. [2019-12-07 18:07:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:07:57,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:57,759 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 18:07:57,759 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -150132667, now seen corresponding path program 2 times [2019-12-07 18:07:57,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:57,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130441149] [2019-12-07 18:07:57,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:57,785 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 18:07:57,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130441149] [2019-12-07 18:07:57,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:57,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:57,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146708765] [2019-12-07 18:07:57,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:57,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:57,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:57,786 INFO L87 Difference]: Start difference. First operand 238906 states and 971586 transitions. Second operand 4 states. [2019-12-07 18:07:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:58,008 INFO L93 Difference]: Finished difference Result 62621 states and 213209 transitions. [2019-12-07 18:07:58,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:58,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 18:07:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:58,115 INFO L225 Difference]: With dead ends: 62621 [2019-12-07 18:07:58,116 INFO L226 Difference]: Without dead ends: 62621 [2019-12-07 18:07:58,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62621 states. [2019-12-07 18:07:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62621 to 62621. [2019-12-07 18:07:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62621 states. [2019-12-07 18:07:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62621 states to 62621 states and 213209 transitions. [2019-12-07 18:07:59,137 INFO L78 Accepts]: Start accepts. Automaton has 62621 states and 213209 transitions. Word has length 22 [2019-12-07 18:07:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:59,137 INFO L462 AbstractCegarLoop]: Abstraction has 62621 states and 213209 transitions. [2019-12-07 18:07:59,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62621 states and 213209 transitions. [2019-12-07 18:07:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:07:59,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:59,146 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] [2019-12-07 18:07:59,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-07 18:07:59,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:59,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729931575] [2019-12-07 18:07:59,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:59,189 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 18:07:59,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729931575] [2019-12-07 18:07:59,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:59,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:59,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493827413] [2019-12-07 18:07:59,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:59,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:59,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:59,191 INFO L87 Difference]: Start difference. First operand 62621 states and 213209 transitions. Second operand 6 states. [2019-12-07 18:08:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:00,305 INFO L93 Difference]: Finished difference Result 95809 states and 318254 transitions. [2019-12-07 18:08:00,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:08:00,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 18:08:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:00,447 INFO L225 Difference]: With dead ends: 95809 [2019-12-07 18:08:00,447 INFO L226 Difference]: Without dead ends: 95585 [2019-12-07 18:08:00,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:08:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95585 states. [2019-12-07 18:08:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95585 to 68007. [2019-12-07 18:08:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68007 states. [2019-12-07 18:08:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68007 states to 68007 states and 229538 transitions. [2019-12-07 18:08:01,737 INFO L78 Accepts]: Start accepts. Automaton has 68007 states and 229538 transitions. Word has length 24 [2019-12-07 18:08:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:01,738 INFO L462 AbstractCegarLoop]: Abstraction has 68007 states and 229538 transitions. [2019-12-07 18:08:01,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:08:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 68007 states and 229538 transitions. [2019-12-07 18:08:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:08:01,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:01,762 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] [2019-12-07 18:08:01,762 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash 790027274, now seen corresponding path program 1 times [2019-12-07 18:08:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:01,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344548644] [2019-12-07 18:08:01,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:01,804 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 18:08:01,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344548644] [2019-12-07 18:08:01,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:01,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:01,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877415205] [2019-12-07 18:08:01,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:08:01,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:08:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:01,806 INFO L87 Difference]: Start difference. First operand 68007 states and 229538 transitions. Second operand 6 states. [2019-12-07 18:08:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:02,349 INFO L93 Difference]: Finished difference Result 94344 states and 313595 transitions. [2019-12-07 18:08:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:08:02,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 18:08:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:02,695 INFO L225 Difference]: With dead ends: 94344 [2019-12-07 18:08:02,695 INFO L226 Difference]: Without dead ends: 93619 [2019-12-07 18:08:02,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:08:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93619 states. [2019-12-07 18:08:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93619 to 69791. [2019-12-07 18:08:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69791 states. [2019-12-07 18:08:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69791 states to 69791 states and 235369 transitions. [2019-12-07 18:08:03,932 INFO L78 Accepts]: Start accepts. Automaton has 69791 states and 235369 transitions. Word has length 30 [2019-12-07 18:08:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:03,933 INFO L462 AbstractCegarLoop]: Abstraction has 69791 states and 235369 transitions. [2019-12-07 18:08:03,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:08:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69791 states and 235369 transitions. [2019-12-07 18:08:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:08:03,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:03,973 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 18:08:03,973 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1968017113, now seen corresponding path program 1 times [2019-12-07 18:08:03,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:03,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525069980] [2019-12-07 18:08:03,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:04,008 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 18:08:04,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525069980] [2019-12-07 18:08:04,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:04,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:04,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327345814] [2019-12-07 18:08:04,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:04,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:04,009 INFO L87 Difference]: Start difference. First operand 69791 states and 235369 transitions. Second operand 5 states. [2019-12-07 18:08:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:04,150 INFO L93 Difference]: Finished difference Result 33873 states and 117568 transitions. [2019-12-07 18:08:04,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:08:04,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 18:08:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:04,207 INFO L225 Difference]: With dead ends: 33873 [2019-12-07 18:08:04,207 INFO L226 Difference]: Without dead ends: 33873 [2019-12-07 18:08:04,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33873 states. [2019-12-07 18:08:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33873 to 28581. [2019-12-07 18:08:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28581 states. [2019-12-07 18:08:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28581 states to 28581 states and 95922 transitions. [2019-12-07 18:08:04,817 INFO L78 Accepts]: Start accepts. Automaton has 28581 states and 95922 transitions. Word has length 33 [2019-12-07 18:08:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:04,817 INFO L462 AbstractCegarLoop]: Abstraction has 28581 states and 95922 transitions. [2019-12-07 18:08:04,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 28581 states and 95922 transitions. [2019-12-07 18:08:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:08:04,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:04,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:04,846 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-07 18:08:04,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:04,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020701849] [2019-12-07 18:08:04,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:04,919 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 18:08:04,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020701849] [2019-12-07 18:08:04,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:04,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:04,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110822258] [2019-12-07 18:08:04,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:08:04,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:08:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:04,920 INFO L87 Difference]: Start difference. First operand 28581 states and 95922 transitions. Second operand 7 states. [2019-12-07 18:08:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:05,646 INFO L93 Difference]: Finished difference Result 38265 states and 125377 transitions. [2019-12-07 18:08:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:08:05,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 18:08:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:05,699 INFO L225 Difference]: With dead ends: 38265 [2019-12-07 18:08:05,699 INFO L226 Difference]: Without dead ends: 37596 [2019-12-07 18:08:05,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:08:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37596 states. [2019-12-07 18:08:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37596 to 27895. [2019-12-07 18:08:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27895 states. [2019-12-07 18:08:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27895 states to 27895 states and 93544 transitions. [2019-12-07 18:08:06,207 INFO L78 Accepts]: Start accepts. Automaton has 27895 states and 93544 transitions. Word has length 42 [2019-12-07 18:08:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:06,207 INFO L462 AbstractCegarLoop]: Abstraction has 27895 states and 93544 transitions. [2019-12-07 18:08:06,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:08:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 27895 states and 93544 transitions. [2019-12-07 18:08:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:08:06,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:06,238 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] [2019-12-07 18:08:06,238 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash 799718125, now seen corresponding path program 1 times [2019-12-07 18:08:06,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:06,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096024117] [2019-12-07 18:08:06,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:06,283 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 18:08:06,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096024117] [2019-12-07 18:08:06,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:06,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:06,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551279565] [2019-12-07 18:08:06,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:06,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:06,284 INFO L87 Difference]: Start difference. First operand 27895 states and 93544 transitions. Second operand 5 states. [2019-12-07 18:08:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:06,700 INFO L93 Difference]: Finished difference Result 42035 states and 140475 transitions. [2019-12-07 18:08:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:08:06,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 18:08:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:06,761 INFO L225 Difference]: With dead ends: 42035 [2019-12-07 18:08:06,761 INFO L226 Difference]: Without dead ends: 42035 [2019-12-07 18:08:06,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42035 states. [2019-12-07 18:08:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42035 to 35397. [2019-12-07 18:08:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35397 states. [2019-12-07 18:08:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35397 states to 35397 states and 118744 transitions. [2019-12-07 18:08:07,350 INFO L78 Accepts]: Start accepts. Automaton has 35397 states and 118744 transitions. Word has length 43 [2019-12-07 18:08:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:07,350 INFO L462 AbstractCegarLoop]: Abstraction has 35397 states and 118744 transitions. [2019-12-07 18:08:07,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35397 states and 118744 transitions. [2019-12-07 18:08:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:08:07,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:07,387 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] [2019-12-07 18:08:07,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash 585685071, now seen corresponding path program 2 times [2019-12-07 18:08:07,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:07,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633594776] [2019-12-07 18:08:07,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:07,429 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 18:08:07,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633594776] [2019-12-07 18:08:07,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:07,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:07,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80024379] [2019-12-07 18:08:07,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:07,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:07,430 INFO L87 Difference]: Start difference. First operand 35397 states and 118744 transitions. Second operand 3 states. [2019-12-07 18:08:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:07,562 INFO L93 Difference]: Finished difference Result 27895 states and 92505 transitions. [2019-12-07 18:08:07,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:07,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 18:08:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:07,604 INFO L225 Difference]: With dead ends: 27895 [2019-12-07 18:08:07,604 INFO L226 Difference]: Without dead ends: 27895 [2019-12-07 18:08:07,604 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 18:08:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27895 states. [2019-12-07 18:08:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27895 to 27595. [2019-12-07 18:08:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27595 states. [2019-12-07 18:08:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27595 states to 27595 states and 91577 transitions. [2019-12-07 18:08:08,016 INFO L78 Accepts]: Start accepts. Automaton has 27595 states and 91577 transitions. Word has length 43 [2019-12-07 18:08:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:08,016 INFO L462 AbstractCegarLoop]: Abstraction has 27595 states and 91577 transitions. [2019-12-07 18:08:08,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 27595 states and 91577 transitions. [2019-12-07 18:08:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:08:08,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:08,045 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] [2019-12-07 18:08:08,046 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash -626667720, now seen corresponding path program 1 times [2019-12-07 18:08:08,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:08,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369761859] [2019-12-07 18:08:08,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:08,089 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 18:08:08,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369761859] [2019-12-07 18:08:08,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:08,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:08,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845747506] [2019-12-07 18:08:08,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:08:08,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:08:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:08,090 INFO L87 Difference]: Start difference. First operand 27595 states and 91577 transitions. Second operand 6 states. [2019-12-07 18:08:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:08,201 INFO L93 Difference]: Finished difference Result 25582 states and 86980 transitions. [2019-12-07 18:08:08,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:08:08,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 18:08:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:08,239 INFO L225 Difference]: With dead ends: 25582 [2019-12-07 18:08:08,239 INFO L226 Difference]: Without dead ends: 25354 [2019-12-07 18:08:08,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25354 states. [2019-12-07 18:08:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25354 to 17869. [2019-12-07 18:08:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17869 states. [2019-12-07 18:08:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17869 states to 17869 states and 62755 transitions. [2019-12-07 18:08:08,576 INFO L78 Accepts]: Start accepts. Automaton has 17869 states and 62755 transitions. Word has length 44 [2019-12-07 18:08:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:08,576 INFO L462 AbstractCegarLoop]: Abstraction has 17869 states and 62755 transitions. [2019-12-07 18:08:08,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:08:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17869 states and 62755 transitions. [2019-12-07 18:08:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:08:08,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:08,594 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] [2019-12-07 18:08:08,594 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1045390656, now seen corresponding path program 1 times [2019-12-07 18:08:08,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:08,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300435841] [2019-12-07 18:08:08,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:08,617 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 18:08:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300435841] [2019-12-07 18:08:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:08,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553395180] [2019-12-07 18:08:08,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:08,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:08,618 INFO L87 Difference]: Start difference. First operand 17869 states and 62755 transitions. Second operand 3 states. [2019-12-07 18:08:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:08,704 INFO L93 Difference]: Finished difference Result 24929 states and 87649 transitions. [2019-12-07 18:08:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:08,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 18:08:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:08,744 INFO L225 Difference]: With dead ends: 24929 [2019-12-07 18:08:08,744 INFO L226 Difference]: Without dead ends: 24929 [2019-12-07 18:08:08,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24929 states. [2019-12-07 18:08:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24929 to 20385. [2019-12-07 18:08:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20385 states. [2019-12-07 18:08:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20385 states to 20385 states and 71965 transitions. [2019-12-07 18:08:09,100 INFO L78 Accepts]: Start accepts. Automaton has 20385 states and 71965 transitions. Word has length 58 [2019-12-07 18:08:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:09,100 INFO L462 AbstractCegarLoop]: Abstraction has 20385 states and 71965 transitions. [2019-12-07 18:08:09,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20385 states and 71965 transitions. [2019-12-07 18:08:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:08:09,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:09,120 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] [2019-12-07 18:08:09,120 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 723016660, now seen corresponding path program 1 times [2019-12-07 18:08:09,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:09,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988843353] [2019-12-07 18:08:09,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:09,167 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 18:08:09,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988843353] [2019-12-07 18:08:09,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:09,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:09,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497479612] [2019-12-07 18:08:09,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:09,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:09,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:09,169 INFO L87 Difference]: Start difference. First operand 20385 states and 71965 transitions. Second operand 4 states. [2019-12-07 18:08:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:09,262 INFO L93 Difference]: Finished difference Result 29401 states and 99630 transitions. [2019-12-07 18:08:09,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:09,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 18:08:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:09,273 INFO L225 Difference]: With dead ends: 29401 [2019-12-07 18:08:09,273 INFO L226 Difference]: Without dead ends: 9567 [2019-12-07 18:08:09,273 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 18:08:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9567 states. [2019-12-07 18:08:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9567 to 9567. [2019-12-07 18:08:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2019-12-07 18:08:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 29200 transitions. [2019-12-07 18:08:09,399 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 29200 transitions. Word has length 58 [2019-12-07 18:08:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:09,400 INFO L462 AbstractCegarLoop]: Abstraction has 9567 states and 29200 transitions. [2019-12-07 18:08:09,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 29200 transitions. [2019-12-07 18:08:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:08:09,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:09,407 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] [2019-12-07 18:08:09,407 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1491599706, now seen corresponding path program 1 times [2019-12-07 18:08:09,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:09,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340823065] [2019-12-07 18:08:09,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:09,426 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 18:08:09,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340823065] [2019-12-07 18:08:09,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:09,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:09,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575732270] [2019-12-07 18:08:09,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:09,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:09,427 INFO L87 Difference]: Start difference. First operand 9567 states and 29200 transitions. Second operand 3 states. [2019-12-07 18:08:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:09,496 INFO L93 Difference]: Finished difference Result 10995 states and 32653 transitions. [2019-12-07 18:08:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:09,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 18:08:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:09,510 INFO L225 Difference]: With dead ends: 10995 [2019-12-07 18:08:09,510 INFO L226 Difference]: Without dead ends: 10629 [2019-12-07 18:08:09,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10629 states. [2019-12-07 18:08:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10629 to 8297. [2019-12-07 18:08:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2019-12-07 18:08:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 25054 transitions. [2019-12-07 18:08:09,633 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 25054 transitions. Word has length 58 [2019-12-07 18:08:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:09,634 INFO L462 AbstractCegarLoop]: Abstraction has 8297 states and 25054 transitions. [2019-12-07 18:08:09,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 25054 transitions. [2019-12-07 18:08:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:08:09,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:09,640 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] [2019-12-07 18:08:09,641 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 2 times [2019-12-07 18:08:09,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:09,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693488925] [2019-12-07 18:08:09,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:09,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:08:09,714 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:08:09,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:08:09,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:08:09,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-07 18:08:09,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:08:09,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-07 18:08:09,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} 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 18:08:09,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-613356867 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-613356867| ~y$w_buff1~0_In-613356867) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-613356867 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-613356867 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-613356867 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-613356867 256))))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-613356867| |P1Thread1of1ForFork2_#t~ite12_Out-613356867|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-613356867| |P1Thread1of1ForFork2_#t~ite11_Out-613356867|) (= |P1Thread1of1ForFork2_#t~ite12_Out-613356867| ~y$w_buff1~0_In-613356867)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-613356867, ~y$w_buff1~0=~y$w_buff1~0_In-613356867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-613356867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-613356867, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-613356867|, ~weak$$choice2~0=~weak$$choice2~0_In-613356867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-613356867} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-613356867, ~y$w_buff1~0=~y$w_buff1~0_In-613356867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-613356867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-613356867, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-613356867|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-613356867|, ~weak$$choice2~0=~weak$$choice2~0_In-613356867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-613356867} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 18:08:09,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1654483330 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out1654483330| ~y$w_buff0_used~0_In1654483330) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1654483330| |P1Thread1of1ForFork2_#t~ite14_Out1654483330|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1654483330| ~y$w_buff0_used~0_In1654483330) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1654483330 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1654483330 256))) (= (mod ~y$w_buff0_used~0_In1654483330 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1654483330 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out1654483330| |P1Thread1of1ForFork2_#t~ite15_Out1654483330|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1654483330, ~weak$$choice2~0=~weak$$choice2~0_In1654483330, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1654483330, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1654483330|, ~weak$$choice2~0=~weak$$choice2~0_In1654483330, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 18:08:09,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-288516922 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite18_Out-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-288516922 256))) (.cse5 (= (mod ~weak$$choice2~0_In-288516922 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-288516922 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-288516922 256) 0))) (or (and (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3)) (= ~y$w_buff1_used~0_In-288516922 |P1Thread1of1ForFork2_#t~ite17_Out-288516922|) .cse5) (and (= |P1Thread1of1ForFork2_#t~ite18_Out-288516922| ~y$w_buff1_used~0_In-288516922) (not .cse5) (= |P1Thread1of1ForFork2_#t~ite17_In-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|))) (= |P1Thread1of1ForFork2_#t~ite16_In-288516922| |P1Thread1of1ForFork2_#t~ite16_Out-288516922|)) (let ((.cse6 (not .cse3))) (and (= |P1Thread1of1ForFork2_#t~ite16_Out-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|) (not .cse1) .cse0 (= 0 |P1Thread1of1ForFork2_#t~ite16_Out-288516922|) (or .cse6 (not .cse4)) .cse5 (or .cse6 (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In-288516922|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out-288516922|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out-288516922|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 18:08:09,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:08:09,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-785337181 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-785337181| |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (= ~y$r_buff1_thd2~0_In-785337181 |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-785337181 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-785337181 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-785337181 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-785337181 256))))) (and (= |P1Thread1of1ForFork2_#t~ite23_In-785337181| |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-785337181| ~y$r_buff1_thd2~0_In-785337181)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-785337181, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-785337181, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785337181, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-785337181|, ~weak$$choice2~0=~weak$$choice2~0_In-785337181, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-785337181} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-785337181, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-785337181, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785337181, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-785337181|, ~weak$$choice2~0=~weak$$choice2~0_In-785337181, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-785337181|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-785337181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 18:08:09,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:08:09,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| |P3Thread1of1ForFork0_#t~ite33_Out-1421410405|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1421410405 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-1421410405 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| ~y$w_buff1~0_In-1421410405) (not .cse0) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| ~y~0_In-1421410405) .cse1 (or .cse0 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1421410405, ~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1421410405, ~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1421410405|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1421410405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 18:08:09,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1247619388 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1247619388 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1247619388| ~y$w_buff0_used~0_In1247619388) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1247619388|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1247619388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247619388} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1247619388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247619388, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1247619388|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 18:08:09,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In6878931 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In6878931 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In6878931 256)))) (or (and (= ~y$w_buff1_used~0_In6878931 |P3Thread1of1ForFork0_#t~ite35_Out6878931|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out6878931|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out6878931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 18:08:09,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1229074567 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1229074567 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1229074567| ~y$r_buff0_thd4~0_In1229074567)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1229074567| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1229074567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1229074567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1229074567|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 18:08:09,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In550460892 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In550460892 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In550460892 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In550460892 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out550460892| 0)) (and (= ~y$r_buff1_thd4~0_In550460892 |P3Thread1of1ForFork0_#t~ite37_Out550460892|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In550460892, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In550460892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550460892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550460892} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In550460892, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In550460892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550460892, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out550460892|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550460892} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 18:08:09,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:08:09,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1098839980 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1098839980 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1098839980 |P2Thread1of1ForFork3_#t~ite28_Out-1098839980|)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1098839980|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098839980, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1098839980} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098839980, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1098839980, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1098839980|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 18:08:09,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-572789 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-572789 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-572789 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-572789 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-572789| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-572789| ~y$w_buff1_used~0_In-572789) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-572789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572789} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-572789, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-572789|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572789} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 18:08:09,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1606857859 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= ~y$r_buff0_thd3~0_Out1606857859 ~y$r_buff0_thd3~0_In1606857859))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd3~0_Out1606857859 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1606857859} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1606857859|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1606857859} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 18:08:09,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1424065344 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1424065344 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1424065344 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1424065344 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out1424065344| ~y$r_buff1_thd3~0_In1424065344) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1424065344| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1424065344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1424065344, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1424065344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 18:08:09,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 18:08:09,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:08:09,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1030726194 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1030726194 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1030726194| ~y$w_buff1~0_In1030726194) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1030726194| ~y~0_In1030726194)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1030726194, ~y~0=~y~0_In1030726194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1030726194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030726194} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1030726194, ~y~0=~y~0_In1030726194, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1030726194|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1030726194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030726194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:08:09,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:08:09,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In818053462 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In818053462 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out818053462| ~y$w_buff0_used~0_In818053462) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out818053462|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In818053462} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In818053462, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out818053462|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:08:09,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-211499326 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-211499326 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-211499326 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-211499326 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-211499326|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-211499326 |ULTIMATE.start_main_#t~ite45_Out-211499326|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211499326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211499326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211499326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211499326, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-211499326|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:08:09,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1148785092 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1148785092 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1148785092| ~y$r_buff0_thd0~0_In1148785092) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out1148785092| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1148785092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 18:08:09,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1582685182 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1582685182 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1582685182 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1582685182 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1582685182| ~y$r_buff1_thd0~0_In-1582685182) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1582685182| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582685182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1582685182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582685182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582685182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582685182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1582685182, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1582685182|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582685182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582685182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 18:08:09,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:08:09,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:08:09 BasicIcfg [2019-12-07 18:08:09,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:08:09,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:08:09,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:08:09,782 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:08:09,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:30" (3/4) ... [2019-12-07 18:08:09,785 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:08:09,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:08:09,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:08:09,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-07 18:08:09,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:08:09,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-07 18:08:09,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} 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 18:08:09,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-613356867 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-613356867| ~y$w_buff1~0_In-613356867) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-613356867 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-613356867 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-613356867 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-613356867 256))))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-613356867| |P1Thread1of1ForFork2_#t~ite12_Out-613356867|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-613356867| |P1Thread1of1ForFork2_#t~ite11_Out-613356867|) (= |P1Thread1of1ForFork2_#t~ite12_Out-613356867| ~y$w_buff1~0_In-613356867)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-613356867, ~y$w_buff1~0=~y$w_buff1~0_In-613356867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-613356867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-613356867, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-613356867|, ~weak$$choice2~0=~weak$$choice2~0_In-613356867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-613356867} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-613356867, ~y$w_buff1~0=~y$w_buff1~0_In-613356867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-613356867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-613356867, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-613356867|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-613356867|, ~weak$$choice2~0=~weak$$choice2~0_In-613356867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-613356867} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 18:08:09,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1654483330 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out1654483330| ~y$w_buff0_used~0_In1654483330) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1654483330| |P1Thread1of1ForFork2_#t~ite14_Out1654483330|)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1654483330| ~y$w_buff0_used~0_In1654483330) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1654483330 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1654483330 256))) (= (mod ~y$w_buff0_used~0_In1654483330 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1654483330 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out1654483330| |P1Thread1of1ForFork2_#t~ite15_Out1654483330|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1654483330, ~weak$$choice2~0=~weak$$choice2~0_In1654483330, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1654483330, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1654483330|, ~weak$$choice2~0=~weak$$choice2~0_In1654483330, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 18:08:09,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-288516922 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite18_Out-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-288516922 256))) (.cse5 (= (mod ~weak$$choice2~0_In-288516922 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-288516922 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-288516922 256) 0))) (or (and (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3)) (= ~y$w_buff1_used~0_In-288516922 |P1Thread1of1ForFork2_#t~ite17_Out-288516922|) .cse5) (and (= |P1Thread1of1ForFork2_#t~ite18_Out-288516922| ~y$w_buff1_used~0_In-288516922) (not .cse5) (= |P1Thread1of1ForFork2_#t~ite17_In-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|))) (= |P1Thread1of1ForFork2_#t~ite16_In-288516922| |P1Thread1of1ForFork2_#t~ite16_Out-288516922|)) (let ((.cse6 (not .cse3))) (and (= |P1Thread1of1ForFork2_#t~ite16_Out-288516922| |P1Thread1of1ForFork2_#t~ite17_Out-288516922|) (not .cse1) .cse0 (= 0 |P1Thread1of1ForFork2_#t~ite16_Out-288516922|) (or .cse6 (not .cse4)) .cse5 (or .cse6 (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In-288516922|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out-288516922|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out-288516922|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 18:08:09,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:08:09,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-785337181 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-785337181| |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (= ~y$r_buff1_thd2~0_In-785337181 |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-785337181 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-785337181 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-785337181 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-785337181 256))))) (and (= |P1Thread1of1ForFork2_#t~ite23_In-785337181| |P1Thread1of1ForFork2_#t~ite23_Out-785337181|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-785337181| ~y$r_buff1_thd2~0_In-785337181)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-785337181, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-785337181, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785337181, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-785337181|, ~weak$$choice2~0=~weak$$choice2~0_In-785337181, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-785337181} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-785337181, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-785337181, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785337181, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-785337181|, ~weak$$choice2~0=~weak$$choice2~0_In-785337181, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-785337181|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-785337181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 18:08:09,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:08:09,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| |P3Thread1of1ForFork0_#t~ite33_Out-1421410405|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1421410405 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-1421410405 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| ~y$w_buff1~0_In-1421410405) (not .cse0) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1421410405| ~y~0_In-1421410405) .cse1 (or .cse0 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1421410405, ~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1421410405, ~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-1421410405|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1421410405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 18:08:09,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1247619388 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1247619388 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1247619388| ~y$w_buff0_used~0_In1247619388) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1247619388|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1247619388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247619388} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1247619388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1247619388, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1247619388|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 18:08:09,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In6878931 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In6878931 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In6878931 256)))) (or (and (= ~y$w_buff1_used~0_In6878931 |P3Thread1of1ForFork0_#t~ite35_Out6878931|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out6878931|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out6878931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 18:08:09,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1229074567 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1229074567 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1229074567| ~y$r_buff0_thd4~0_In1229074567)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1229074567| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1229074567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1229074567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1229074567|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 18:08:09,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In550460892 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In550460892 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In550460892 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In550460892 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out550460892| 0)) (and (= ~y$r_buff1_thd4~0_In550460892 |P3Thread1of1ForFork0_#t~ite37_Out550460892|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In550460892, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In550460892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550460892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550460892} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In550460892, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In550460892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In550460892, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out550460892|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550460892} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 18:08:09,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:08:09,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1098839980 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1098839980 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1098839980 |P2Thread1of1ForFork3_#t~ite28_Out-1098839980|)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1098839980|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098839980, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1098839980} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098839980, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1098839980, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1098839980|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 18:08:09,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-572789 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-572789 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-572789 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-572789 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-572789| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-572789| ~y$w_buff1_used~0_In-572789) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-572789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572789} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-572789, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-572789|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572789} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 18:08:09,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1606857859 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= ~y$r_buff0_thd3~0_Out1606857859 ~y$r_buff0_thd3~0_In1606857859))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd3~0_Out1606857859 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1606857859} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1606857859|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1606857859} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 18:08:09,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1424065344 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1424065344 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1424065344 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1424065344 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out1424065344| ~y$r_buff1_thd3~0_In1424065344) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1424065344| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1424065344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1424065344, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1424065344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 18:08:09,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 18:08:09,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:08:09,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1030726194 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1030726194 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1030726194| ~y$w_buff1~0_In1030726194) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1030726194| ~y~0_In1030726194)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1030726194, ~y~0=~y~0_In1030726194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1030726194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030726194} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1030726194, ~y~0=~y~0_In1030726194, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1030726194|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1030726194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1030726194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:08:09,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:08:09,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In818053462 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In818053462 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out818053462| ~y$w_buff0_used~0_In818053462) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out818053462|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In818053462} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In818053462, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out818053462|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:08:09,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-211499326 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-211499326 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-211499326 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-211499326 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-211499326|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-211499326 |ULTIMATE.start_main_#t~ite45_Out-211499326|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211499326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211499326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-211499326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-211499326, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-211499326|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:08:09,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1148785092 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1148785092 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1148785092| ~y$r_buff0_thd0~0_In1148785092) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out1148785092| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1148785092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 18:08:09,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1582685182 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1582685182 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1582685182 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1582685182 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1582685182| ~y$r_buff1_thd0~0_In-1582685182) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1582685182| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582685182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1582685182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582685182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582685182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582685182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1582685182, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1582685182|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1582685182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582685182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 18:08:09,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:08:09,846 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_179b6ccc-5203-4074-b4d9-08bec0d926b1/bin/uautomizer/witness.graphml [2019-12-07 18:08:09,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:08:09,847 INFO L168 Benchmark]: Toolchain (without parser) took 220428.05 ms. Allocated memory was 1.0 GB in the beginning and 10.2 GB in the end (delta: 9.2 GB). Free memory was 936.0 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,847 INFO L168 Benchmark]: CDTParser took 0.16 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 18:08:09,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,848 INFO L168 Benchmark]: Boogie Preprocessor took 26.79 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 18:08:09,848 INFO L168 Benchmark]: RCFGBuilder took 402.36 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,848 INFO L168 Benchmark]: TraceAbstraction took 219497.64 ms. Allocated memory was 1.1 GB in the beginning and 10.2 GB in the end (delta: 9.1 GB). Free memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,848 INFO L168 Benchmark]: Witness Printer took 63.57 ms. Allocated memory is still 10.2 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:09,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.16 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 394.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.79 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. * RCFGBuilder took 402.36 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 219497.64 ms. Allocated memory was 1.1 GB in the beginning and 10.2 GB in the end (delta: 9.1 GB). Free memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 63.57 ms. Allocated memory is still 10.2 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 219.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3107 SDtfs, 3122 SDslu, 5043 SDs, 0 SdLazy, 3130 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409778occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 149.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 396259 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 73408 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...