./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/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 4b6d9fe5b3f6997fe1c1c6909cee29db82762d66 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:30,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:30,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:30,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:30,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:30,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:30,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:30,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:30,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:30,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:30,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:30,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:30,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:30,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:30,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:30,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:30,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:30,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:30,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:30,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:30,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:30,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:30,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:30,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:30,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:30,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:30,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:30,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:30,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:30,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:30,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:30,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:30,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:30,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:30,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:30,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:30,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:30,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:30,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:30,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:30,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:30,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:30,220 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:30,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:30,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:30,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:30,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:30,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:30,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:30,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:30,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:30,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:30,224 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:30,224 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_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/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 -> 4b6d9fe5b3f6997fe1c1c6909cee29db82762d66 [2019-12-07 10:07:30,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:30,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:30,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:30,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:30,334 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:30,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2019-12-07 10:07:30,372 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/data/f95b4eb96/bda956017051494db96ae8d7d1761735/FLAG621ce1dc8 [2019-12-07 10:07:30,847 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:30,848 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2019-12-07 10:07:30,858 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/data/f95b4eb96/bda956017051494db96ae8d7d1761735/FLAG621ce1dc8 [2019-12-07 10:07:30,868 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/data/f95b4eb96/bda956017051494db96ae8d7d1761735 [2019-12-07 10:07:30,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:30,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:30,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:30,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:30,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:30,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:30,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:31,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:31,200 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:31,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:31,294 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31 WrapperNode [2019-12-07 10:07:31,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:31,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:31,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:31,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:31,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:31,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:31,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:31,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:31,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 10:07:31,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:31,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:31,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:31,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:31,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:07:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:31,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:31,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:31,418 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:07:31,847 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:31,847 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:31,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31 BoogieIcfgContainer [2019-12-07 10:07:31,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:31,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:31,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:31,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:31,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:30" (1/3) ... [2019-12-07 10:07:31,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31787123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:31, skipping insertion in model container [2019-12-07 10:07:31,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (2/3) ... [2019-12-07 10:07:31,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31787123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:31, skipping insertion in model container [2019-12-07 10:07:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31" (3/3) ... [2019-12-07 10:07:31,853 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2019-12-07 10:07:31,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:31,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:31,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:31,864 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:31,936 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:07:31,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:31,949 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:31,949 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:31,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:31,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:31,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:31,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:31,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:31,961 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 292 transitions [2019-12-07 10:07:31,962 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-07 10:07:32,038 INFO L134 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-07 10:07:32,038 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:32,052 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1259 event pairs. 9/228 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 10:07:32,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-07 10:07:32,129 INFO L134 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-07 10:07:32,129 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:32,139 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1259 event pairs. 9/228 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 10:07:32,170 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-07 10:07:32,170 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:36,164 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 10:07:36,559 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-12-07 10:07:36,706 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-07 10:07:36,739 INFO L206 etLargeBlockEncoding]: Checked pairs total: 168479 [2019-12-07 10:07:36,739 INFO L214 etLargeBlockEncoding]: Total number of compositions: 179 [2019-12-07 10:07:36,741 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 144 transitions [2019-12-07 10:08:16,975 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 220397 states. [2019-12-07 10:08:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 220397 states. [2019-12-07 10:08:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:08:16,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:16,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:08:16,982 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1277248, now seen corresponding path program 1 times [2019-12-07 10:08:16,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:16,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440109094] [2019-12-07 10:08:16,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:17,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440109094] [2019-12-07 10:08:17,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:17,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:08:17,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722803814] [2019-12-07 10:08:17,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:17,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:17,155 INFO L87 Difference]: Start difference. First operand 220397 states. Second operand 3 states. [2019-12-07 10:08:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:20,366 INFO L93 Difference]: Finished difference Result 218349 states and 982032 transitions. [2019-12-07 10:08:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:20,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:08:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:21,256 INFO L225 Difference]: With dead ends: 218349 [2019-12-07 10:08:21,256 INFO L226 Difference]: Without dead ends: 208378 [2019-12-07 10:08:21,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208378 states. [2019-12-07 10:08:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208378 to 208378. [2019-12-07 10:08:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208378 states. [2019-12-07 10:08:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208378 states to 208378 states and 936818 transitions. [2019-12-07 10:08:32,489 INFO L78 Accepts]: Start accepts. Automaton has 208378 states and 936818 transitions. Word has length 3 [2019-12-07 10:08:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:32,490 INFO L462 AbstractCegarLoop]: Abstraction has 208378 states and 936818 transitions. [2019-12-07 10:08:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 208378 states and 936818 transitions. [2019-12-07 10:08:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:08:32,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:32,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:32,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205327, now seen corresponding path program 1 times [2019-12-07 10:08:32,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:32,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711031412] [2019-12-07 10:08:32,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:32,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711031412] [2019-12-07 10:08:32,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:32,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:32,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147968977] [2019-12-07 10:08:32,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:32,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:32,566 INFO L87 Difference]: Start difference. First operand 208378 states and 936818 transitions. Second operand 4 states. [2019-12-07 10:08:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:37,982 INFO L93 Difference]: Finished difference Result 340364 states and 1449524 transitions. [2019-12-07 10:08:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:37,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:08:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:38,927 INFO L225 Difference]: With dead ends: 340364 [2019-12-07 10:08:38,927 INFO L226 Difference]: Without dead ends: 340315 [2019-12-07 10:08:38,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340315 states. [2019-12-07 10:08:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340315 to 317110. [2019-12-07 10:08:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317110 states. [2019-12-07 10:08:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317110 states to 317110 states and 1364138 transitions. [2019-12-07 10:08:53,480 INFO L78 Accepts]: Start accepts. Automaton has 317110 states and 1364138 transitions. Word has length 13 [2019-12-07 10:08:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:53,481 INFO L462 AbstractCegarLoop]: Abstraction has 317110 states and 1364138 transitions. [2019-12-07 10:08:53,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 317110 states and 1364138 transitions. [2019-12-07 10:08:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:08:53,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:53,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:53,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash -109558141, now seen corresponding path program 1 times [2019-12-07 10:08:53,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:53,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313665984] [2019-12-07 10:08:53,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:53,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313665984] [2019-12-07 10:08:53,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:53,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:53,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892925297] [2019-12-07 10:08:53,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:53,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:53,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:53,534 INFO L87 Difference]: Start difference. First operand 317110 states and 1364138 transitions. Second operand 4 states. [2019-12-07 10:08:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:59,724 INFO L93 Difference]: Finished difference Result 444807 states and 1863362 transitions. [2019-12-07 10:08:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:59,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:08:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:00,975 INFO L225 Difference]: With dead ends: 444807 [2019-12-07 10:09:00,976 INFO L226 Difference]: Without dead ends: 444751 [2019-12-07 10:09:00,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444751 states. [2019-12-07 10:09:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444751 to 371018. [2019-12-07 10:09:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371018 states. [2019-12-07 10:09:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371018 states to 371018 states and 1583291 transitions. [2019-12-07 10:09:18,633 INFO L78 Accepts]: Start accepts. Automaton has 371018 states and 1583291 transitions. Word has length 13 [2019-12-07 10:09:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:18,633 INFO L462 AbstractCegarLoop]: Abstraction has 371018 states and 1583291 transitions. [2019-12-07 10:09:18,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 371018 states and 1583291 transitions. [2019-12-07 10:09:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:18,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:18,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:18,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2085368158, now seen corresponding path program 1 times [2019-12-07 10:09:18,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:18,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672273955] [2019-12-07 10:09:18,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:18,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672273955] [2019-12-07 10:09:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:18,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:18,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030400827] [2019-12-07 10:09:18,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:18,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:18,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:18,665 INFO L87 Difference]: Start difference. First operand 371018 states and 1583291 transitions. Second operand 3 states. [2019-12-07 10:09:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:25,636 INFO L93 Difference]: Finished difference Result 494134 states and 2097383 transitions. [2019-12-07 10:09:25,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:25,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 10:09:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:27,009 INFO L225 Difference]: With dead ends: 494134 [2019-12-07 10:09:27,009 INFO L226 Difference]: Without dead ends: 494134 [2019-12-07 10:09:27,009 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 10:09:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494134 states. [2019-12-07 10:09:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494134 to 405381. [2019-12-07 10:09:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405381 states. [2019-12-07 10:09:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405381 states to 405381 states and 1733904 transitions. [2019-12-07 10:09:46,177 INFO L78 Accepts]: Start accepts. Automaton has 405381 states and 1733904 transitions. Word has length 14 [2019-12-07 10:09:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:46,177 INFO L462 AbstractCegarLoop]: Abstraction has 405381 states and 1733904 transitions. [2019-12-07 10:09:46,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 405381 states and 1733904 transitions. [2019-12-07 10:09:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:46,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:46,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:46,182 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:46,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:46,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2085161729, now seen corresponding path program 1 times [2019-12-07 10:09:46,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:46,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904968747] [2019-12-07 10:09:46,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:46,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904968747] [2019-12-07 10:09:46,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:46,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:46,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177990715] [2019-12-07 10:09:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:46,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:46,239 INFO L87 Difference]: Start difference. First operand 405381 states and 1733904 transitions. Second operand 5 states. [2019-12-07 10:09:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:53,878 INFO L93 Difference]: Finished difference Result 606078 states and 2522493 transitions. [2019-12-07 10:09:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:53,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:09:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:55,777 INFO L225 Difference]: With dead ends: 606078 [2019-12-07 10:09:55,777 INFO L226 Difference]: Without dead ends: 606078 [2019-12-07 10:09:55,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:10:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606078 states. [2019-12-07 10:10:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606078 to 424151. [2019-12-07 10:10:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424151 states. [2019-12-07 10:10:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424151 states to 424151 states and 1808031 transitions. [2019-12-07 10:10:17,174 INFO L78 Accepts]: Start accepts. Automaton has 424151 states and 1808031 transitions. Word has length 14 [2019-12-07 10:10:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:17,174 INFO L462 AbstractCegarLoop]: Abstraction has 424151 states and 1808031 transitions. [2019-12-07 10:10:17,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:10:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 424151 states and 1808031 transitions. [2019-12-07 10:10:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:10:17,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:17,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:10:17,180 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -515013518, now seen corresponding path program 1 times [2019-12-07 10:10:17,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:17,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782945367] [2019-12-07 10:10:17,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:10:17,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782945367] [2019-12-07 10:10:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:17,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:10:17,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40634844] [2019-12-07 10:10:17,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:17,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:17,235 INFO L87 Difference]: Start difference. First operand 424151 states and 1808031 transitions. Second operand 5 states. [2019-12-07 10:10:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:25,082 INFO L93 Difference]: Finished difference Result 576579 states and 2414508 transitions. [2019-12-07 10:10:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:10:25,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:10:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:26,988 INFO L225 Difference]: With dead ends: 576579 [2019-12-07 10:10:26,988 INFO L226 Difference]: Without dead ends: 576579 [2019-12-07 10:10:26,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:10:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576579 states. [2019-12-07 10:10:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576579 to 442172. [2019-12-07 10:10:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442172 states. [2019-12-07 10:10:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442172 states to 442172 states and 1884421 transitions. [2019-12-07 10:10:47,602 INFO L78 Accepts]: Start accepts. Automaton has 442172 states and 1884421 transitions. Word has length 14 [2019-12-07 10:10:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:47,602 INFO L462 AbstractCegarLoop]: Abstraction has 442172 states and 1884421 transitions. [2019-12-07 10:10:47,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:10:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 442172 states and 1884421 transitions. [2019-12-07 10:10:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:10:47,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:47,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:10:47,634 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:47,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1574642654, now seen corresponding path program 1 times [2019-12-07 10:10:47,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:47,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143446580] [2019-12-07 10:10:47,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:10:47,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143446580] [2019-12-07 10:10:47,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:47,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:47,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903240460] [2019-12-07 10:10:47,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:47,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:47,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:47,684 INFO L87 Difference]: Start difference. First operand 442172 states and 1884421 transitions. Second operand 5 states. [2019-12-07 10:10:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:56,765 INFO L93 Difference]: Finished difference Result 633026 states and 2637494 transitions. [2019-12-07 10:10:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:10:56,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:10:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:58,757 INFO L225 Difference]: With dead ends: 633026 [2019-12-07 10:10:58,758 INFO L226 Difference]: Without dead ends: 632935 [2019-12-07 10:10:58,758 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 10:11:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632935 states. [2019-12-07 10:11:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632935 to 470095. [2019-12-07 10:11:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470095 states. [2019-12-07 10:11:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470095 states to 470095 states and 1996914 transitions. [2019-12-07 10:11:21,073 INFO L78 Accepts]: Start accepts. Automaton has 470095 states and 1996914 transitions. Word has length 19 [2019-12-07 10:11:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:21,073 INFO L462 AbstractCegarLoop]: Abstraction has 470095 states and 1996914 transitions. [2019-12-07 10:11:21,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:11:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 470095 states and 1996914 transitions. [2019-12-07 10:11:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:11:21,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:21,115 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 10:11:21,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -15165950, now seen corresponding path program 1 times [2019-12-07 10:11:21,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:21,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28745264] [2019-12-07 10:11:21,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:21,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 10:11:21,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28745264] [2019-12-07 10:11:21,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:21,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:11:21,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817837497] [2019-12-07 10:11:21,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:11:21,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:21,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:11:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:11:21,161 INFO L87 Difference]: Start difference. First operand 470095 states and 1996914 transitions. Second operand 3 states. [2019-12-07 10:11:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:23,881 INFO L93 Difference]: Finished difference Result 447726 states and 1889629 transitions. [2019-12-07 10:11:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:11:23,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:11:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:30,475 INFO L225 Difference]: With dead ends: 447726 [2019-12-07 10:11:30,475 INFO L226 Difference]: Without dead ends: 447726 [2019-12-07 10:11:30,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:11:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447726 states. [2019-12-07 10:11:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447726 to 444654. [2019-12-07 10:11:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444654 states. [2019-12-07 10:11:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444654 states to 444654 states and 1878273 transitions. [2019-12-07 10:11:48,054 INFO L78 Accepts]: Start accepts. Automaton has 444654 states and 1878273 transitions. Word has length 20 [2019-12-07 10:11:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:48,054 INFO L462 AbstractCegarLoop]: Abstraction has 444654 states and 1878273 transitions. [2019-12-07 10:11:48,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:11:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 444654 states and 1878273 transitions. [2019-12-07 10:11:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:11:48,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:48,090 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 10:11:48,090 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -993714604, now seen corresponding path program 1 times [2019-12-07 10:11:48,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:48,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477192741] [2019-12-07 10:11:48,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:11:48,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477192741] [2019-12-07 10:11:48,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:48,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:11:48,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094482836] [2019-12-07 10:11:48,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:11:48,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:11:48,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:11:48,136 INFO L87 Difference]: Start difference. First operand 444654 states and 1878273 transitions. Second operand 4 states. [2019-12-07 10:11:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:48,557 INFO L93 Difference]: Finished difference Result 104097 states and 364248 transitions. [2019-12-07 10:11:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:11:48,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 10:11:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:48,703 INFO L225 Difference]: With dead ends: 104097 [2019-12-07 10:11:48,703 INFO L226 Difference]: Without dead ends: 82421 [2019-12-07 10:11:48,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:11:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82421 states. [2019-12-07 10:11:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82421 to 82309. [2019-12-07 10:11:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82309 states. [2019-12-07 10:11:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82309 states to 82309 states and 274726 transitions. [2019-12-07 10:11:50,549 INFO L78 Accepts]: Start accepts. Automaton has 82309 states and 274726 transitions. Word has length 20 [2019-12-07 10:11:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 82309 states and 274726 transitions. [2019-12-07 10:11:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:11:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82309 states and 274726 transitions. [2019-12-07 10:11:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:11:50,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:50,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:50,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:50,560 INFO L82 PathProgramCache]: Analyzing trace with hash -241741821, now seen corresponding path program 1 times [2019-12-07 10:11:50,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:50,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325299292] [2019-12-07 10:11:50,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:11:50,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325299292] [2019-12-07 10:11:50,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:50,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:11:50,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673067618] [2019-12-07 10:11:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:11:50,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:11:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:11:50,623 INFO L87 Difference]: Start difference. First operand 82309 states and 274726 transitions. Second operand 6 states. [2019-12-07 10:11:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:51,469 INFO L93 Difference]: Finished difference Result 114838 states and 372377 transitions. [2019-12-07 10:11:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:11:51,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:11:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:51,661 INFO L225 Difference]: With dead ends: 114838 [2019-12-07 10:11:51,661 INFO L226 Difference]: Without dead ends: 114782 [2019-12-07 10:11:51,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:11:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114782 states. [2019-12-07 10:11:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114782 to 86486. [2019-12-07 10:11:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86486 states. [2019-12-07 10:11:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86486 states to 86486 states and 287587 transitions. [2019-12-07 10:11:53,550 INFO L78 Accepts]: Start accepts. Automaton has 86486 states and 287587 transitions. Word has length 22 [2019-12-07 10:11:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:53,550 INFO L462 AbstractCegarLoop]: Abstraction has 86486 states and 287587 transitions. [2019-12-07 10:11:53,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:11:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 86486 states and 287587 transitions. [2019-12-07 10:11:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:11:53,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:53,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:53,559 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -786938448, now seen corresponding path program 1 times [2019-12-07 10:11:53,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:53,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65790121] [2019-12-07 10:11:53,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:11:53,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65790121] [2019-12-07 10:11:53,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:53,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:11:53,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768344769] [2019-12-07 10:11:53,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:11:53,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:53,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:11:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:11:53,639 INFO L87 Difference]: Start difference. First operand 86486 states and 287587 transitions. Second operand 6 states. [2019-12-07 10:11:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:54,590 INFO L93 Difference]: Finished difference Result 119675 states and 388226 transitions. [2019-12-07 10:11:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:11:54,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:11:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:54,790 INFO L225 Difference]: With dead ends: 119675 [2019-12-07 10:11:54,790 INFO L226 Difference]: Without dead ends: 119619 [2019-12-07 10:11:54,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:11:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119619 states. [2019-12-07 10:11:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119619 to 84233. [2019-12-07 10:11:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84233 states. [2019-12-07 10:11:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84233 states to 84233 states and 280078 transitions. [2019-12-07 10:11:56,599 INFO L78 Accepts]: Start accepts. Automaton has 84233 states and 280078 transitions. Word has length 22 [2019-12-07 10:11:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:56,599 INFO L462 AbstractCegarLoop]: Abstraction has 84233 states and 280078 transitions. [2019-12-07 10:11:56,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:11:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 84233 states and 280078 transitions. [2019-12-07 10:11:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:11:56,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:56,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:56,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1507735935, now seen corresponding path program 1 times [2019-12-07 10:11:56,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:56,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133174470] [2019-12-07 10:11:56,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:11:56,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133174470] [2019-12-07 10:11:56,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:56,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:11:56,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269480712] [2019-12-07 10:11:56,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:11:56,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:11:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:11:56,684 INFO L87 Difference]: Start difference. First operand 84233 states and 280078 transitions. Second operand 6 states. [2019-12-07 10:11:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:57,389 INFO L93 Difference]: Finished difference Result 112866 states and 367227 transitions. [2019-12-07 10:11:57,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:11:57,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 10:11:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:57,581 INFO L225 Difference]: With dead ends: 112866 [2019-12-07 10:11:57,581 INFO L226 Difference]: Without dead ends: 112658 [2019-12-07 10:11:57,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:11:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112658 states. [2019-12-07 10:11:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112658 to 88185. [2019-12-07 10:11:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88185 states. [2019-12-07 10:11:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88185 states to 88185 states and 292348 transitions. [2019-12-07 10:11:59,413 INFO L78 Accepts]: Start accepts. Automaton has 88185 states and 292348 transitions. Word has length 25 [2019-12-07 10:11:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:59,413 INFO L462 AbstractCegarLoop]: Abstraction has 88185 states and 292348 transitions. [2019-12-07 10:11:59,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:11:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88185 states and 292348 transitions. [2019-12-07 10:11:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:11:59,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:59,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:59,432 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1209681835, now seen corresponding path program 1 times [2019-12-07 10:11:59,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:59,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737580657] [2019-12-07 10:11:59,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:11:59,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737580657] [2019-12-07 10:11:59,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:59,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:11:59,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807271711] [2019-12-07 10:11:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:11:59,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:11:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:11:59,490 INFO L87 Difference]: Start difference. First operand 88185 states and 292348 transitions. Second operand 5 states. [2019-12-07 10:12:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:00,247 INFO L93 Difference]: Finished difference Result 135681 states and 449539 transitions. [2019-12-07 10:12:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:12:00,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:12:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:00,477 INFO L225 Difference]: With dead ends: 135681 [2019-12-07 10:12:00,477 INFO L226 Difference]: Without dead ends: 135425 [2019-12-07 10:12:00,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:12:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135425 states. [2019-12-07 10:12:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135425 to 88371. [2019-12-07 10:12:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88371 states. [2019-12-07 10:12:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88371 states to 88371 states and 294077 transitions. [2019-12-07 10:12:02,433 INFO L78 Accepts]: Start accepts. Automaton has 88371 states and 294077 transitions. Word has length 26 [2019-12-07 10:12:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:02,433 INFO L462 AbstractCegarLoop]: Abstraction has 88371 states and 294077 transitions. [2019-12-07 10:12:02,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88371 states and 294077 transitions. [2019-12-07 10:12:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:12:02,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:02,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:02,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1967194557, now seen corresponding path program 1 times [2019-12-07 10:12:02,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:02,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559404724] [2019-12-07 10:12:02,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:02,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559404724] [2019-12-07 10:12:02,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:02,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:12:02,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820179603] [2019-12-07 10:12:02,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:02,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:02,526 INFO L87 Difference]: Start difference. First operand 88371 states and 294077 transitions. Second operand 5 states. [2019-12-07 10:12:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:02,657 INFO L93 Difference]: Finished difference Result 35499 states and 112257 transitions. [2019-12-07 10:12:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:12:02,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:12:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:02,701 INFO L225 Difference]: With dead ends: 35499 [2019-12-07 10:12:02,701 INFO L226 Difference]: Without dead ends: 31501 [2019-12-07 10:12:02,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:12:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31501 states. [2019-12-07 10:12:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31501 to 29467. [2019-12-07 10:12:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29467 states. [2019-12-07 10:12:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29467 states to 29467 states and 93192 transitions. [2019-12-07 10:12:03,146 INFO L78 Accepts]: Start accepts. Automaton has 29467 states and 93192 transitions. Word has length 31 [2019-12-07 10:12:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:03,146 INFO L462 AbstractCegarLoop]: Abstraction has 29467 states and 93192 transitions. [2019-12-07 10:12:03,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29467 states and 93192 transitions. [2019-12-07 10:12:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:12:03,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:03,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:03,169 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -962432829, now seen corresponding path program 1 times [2019-12-07 10:12:03,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:03,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891917627] [2019-12-07 10:12:03,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:03,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891917627] [2019-12-07 10:12:03,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:03,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:12:03,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815324382] [2019-12-07 10:12:03,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:12:03,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:12:03,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:12:03,263 INFO L87 Difference]: Start difference. First operand 29467 states and 93192 transitions. Second operand 7 states. [2019-12-07 10:12:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:04,069 INFO L93 Difference]: Finished difference Result 39723 states and 122182 transitions. [2019-12-07 10:12:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:12:04,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 10:12:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:04,123 INFO L225 Difference]: With dead ends: 39723 [2019-12-07 10:12:04,123 INFO L226 Difference]: Without dead ends: 39330 [2019-12-07 10:12:04,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:12:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39330 states. [2019-12-07 10:12:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39330 to 29665. [2019-12-07 10:12:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29665 states. [2019-12-07 10:12:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29665 states to 29665 states and 93705 transitions. [2019-12-07 10:12:04,665 INFO L78 Accepts]: Start accepts. Automaton has 29665 states and 93705 transitions. Word has length 33 [2019-12-07 10:12:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:04,666 INFO L462 AbstractCegarLoop]: Abstraction has 29665 states and 93705 transitions. [2019-12-07 10:12:04,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:12:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29665 states and 93705 transitions. [2019-12-07 10:12:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:04,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:04,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:04,689 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1084459431, now seen corresponding path program 1 times [2019-12-07 10:12:04,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:04,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406748251] [2019-12-07 10:12:04,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:04,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406748251] [2019-12-07 10:12:04,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:04,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:04,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965731203] [2019-12-07 10:12:04,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:04,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:04,761 INFO L87 Difference]: Start difference. First operand 29665 states and 93705 transitions. Second operand 6 states. [2019-12-07 10:12:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:05,475 INFO L93 Difference]: Finished difference Result 49811 states and 154730 transitions. [2019-12-07 10:12:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:12:05,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:12:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:05,541 INFO L225 Difference]: With dead ends: 49811 [2019-12-07 10:12:05,542 INFO L226 Difference]: Without dead ends: 49565 [2019-12-07 10:12:05,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 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 10:12:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49565 states. [2019-12-07 10:12:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49565 to 29877. [2019-12-07 10:12:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29877 states. [2019-12-07 10:12:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29877 states to 29877 states and 94362 transitions. [2019-12-07 10:12:06,118 INFO L78 Accepts]: Start accepts. Automaton has 29877 states and 94362 transitions. Word has length 34 [2019-12-07 10:12:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:06,119 INFO L462 AbstractCegarLoop]: Abstraction has 29877 states and 94362 transitions. [2019-12-07 10:12:06,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29877 states and 94362 transitions. [2019-12-07 10:12:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:06,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:06,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:06,143 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1558074023, now seen corresponding path program 2 times [2019-12-07 10:12:06,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:06,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105492583] [2019-12-07 10:12:06,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:06,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105492583] [2019-12-07 10:12:06,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:06,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:06,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521648424] [2019-12-07 10:12:06,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:06,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:06,211 INFO L87 Difference]: Start difference. First operand 29877 states and 94362 transitions. Second operand 6 states. [2019-12-07 10:12:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:07,097 INFO L93 Difference]: Finished difference Result 44663 states and 137793 transitions. [2019-12-07 10:12:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:12:07,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:12:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:07,151 INFO L225 Difference]: With dead ends: 44663 [2019-12-07 10:12:07,151 INFO L226 Difference]: Without dead ends: 44509 [2019-12-07 10:12:07,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:12:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44509 states. [2019-12-07 10:12:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44509 to 29653. [2019-12-07 10:12:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29653 states. [2019-12-07 10:12:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29653 states to 29653 states and 93565 transitions. [2019-12-07 10:12:07,695 INFO L78 Accepts]: Start accepts. Automaton has 29653 states and 93565 transitions. Word has length 34 [2019-12-07 10:12:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:07,695 INFO L462 AbstractCegarLoop]: Abstraction has 29653 states and 93565 transitions. [2019-12-07 10:12:07,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 29653 states and 93565 transitions. [2019-12-07 10:12:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:07,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:07,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:07,719 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:07,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:07,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1655861333, now seen corresponding path program 3 times [2019-12-07 10:12:07,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:07,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20378931] [2019-12-07 10:12:07,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:07,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20378931] [2019-12-07 10:12:07,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:07,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:12:07,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082986295] [2019-12-07 10:12:07,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:12:07,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:12:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:12:07,952 INFO L87 Difference]: Start difference. First operand 29653 states and 93565 transitions. Second operand 11 states. [2019-12-07 10:12:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:12,298 INFO L93 Difference]: Finished difference Result 92338 states and 283836 transitions. [2019-12-07 10:12:12,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:12:12,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-07 10:12:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:12,439 INFO L225 Difference]: With dead ends: 92338 [2019-12-07 10:12:12,439 INFO L226 Difference]: Without dead ends: 92137 [2019-12-07 10:12:12,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:12:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92137 states. [2019-12-07 10:12:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92137 to 39179. [2019-12-07 10:12:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39179 states. [2019-12-07 10:12:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 125387 transitions. [2019-12-07 10:12:13,505 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 125387 transitions. Word has length 34 [2019-12-07 10:12:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:13,505 INFO L462 AbstractCegarLoop]: Abstraction has 39179 states and 125387 transitions. [2019-12-07 10:12:13,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:12:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 125387 transitions. [2019-12-07 10:12:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:12:13,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:13,546 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 10:12:13,546 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -587287409, now seen corresponding path program 1 times [2019-12-07 10:12:13,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:13,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071461401] [2019-12-07 10:12:13,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:13,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071461401] [2019-12-07 10:12:13,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:13,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:13,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948953356] [2019-12-07 10:12:13,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:13,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:13,594 INFO L87 Difference]: Start difference. First operand 39179 states and 125387 transitions. Second operand 5 states. [2019-12-07 10:12:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:14,206 INFO L93 Difference]: Finished difference Result 53839 states and 168734 transitions. [2019-12-07 10:12:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:12:14,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:12:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:14,276 INFO L225 Difference]: With dead ends: 53839 [2019-12-07 10:12:14,276 INFO L226 Difference]: Without dead ends: 53839 [2019-12-07 10:12:14,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53839 states. [2019-12-07 10:12:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53839 to 45269. [2019-12-07 10:12:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45269 states. [2019-12-07 10:12:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45269 states to 45269 states and 144568 transitions. [2019-12-07 10:12:15,049 INFO L78 Accepts]: Start accepts. Automaton has 45269 states and 144568 transitions. Word has length 42 [2019-12-07 10:12:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:15,049 INFO L462 AbstractCegarLoop]: Abstraction has 45269 states and 144568 transitions. [2019-12-07 10:12:15,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 45269 states and 144568 transitions. [2019-12-07 10:12:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:12:15,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:15,096 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 10:12:15,096 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 604911193, now seen corresponding path program 2 times [2019-12-07 10:12:15,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:15,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550048503] [2019-12-07 10:12:15,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:15,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550048503] [2019-12-07 10:12:15,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:15,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:15,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249925214] [2019-12-07 10:12:15,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:15,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:15,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:15,142 INFO L87 Difference]: Start difference. First operand 45269 states and 144568 transitions. Second operand 5 states. [2019-12-07 10:12:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:15,297 INFO L93 Difference]: Finished difference Result 45438 states and 144803 transitions. [2019-12-07 10:12:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:12:15,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:12:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:15,358 INFO L225 Difference]: With dead ends: 45438 [2019-12-07 10:12:15,358 INFO L226 Difference]: Without dead ends: 45151 [2019-12-07 10:12:15,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 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 10:12:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45151 states. [2019-12-07 10:12:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45151 to 45151. [2019-12-07 10:12:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45151 states. [2019-12-07 10:12:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45151 states to 45151 states and 144171 transitions. [2019-12-07 10:12:16,018 INFO L78 Accepts]: Start accepts. Automaton has 45151 states and 144171 transitions. Word has length 42 [2019-12-07 10:12:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:16,019 INFO L462 AbstractCegarLoop]: Abstraction has 45151 states and 144171 transitions. [2019-12-07 10:12:16,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 45151 states and 144171 transitions. [2019-12-07 10:12:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:12:16,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:16,064 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 10:12:16,064 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1559235497, now seen corresponding path program 1 times [2019-12-07 10:12:16,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:16,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028869707] [2019-12-07 10:12:16,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:16,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028869707] [2019-12-07 10:12:16,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:16,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:12:16,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194057528] [2019-12-07 10:12:16,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:16,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:16,098 INFO L87 Difference]: Start difference. First operand 45151 states and 144171 transitions. Second operand 3 states. [2019-12-07 10:12:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:16,221 INFO L93 Difference]: Finished difference Result 44797 states and 143334 transitions. [2019-12-07 10:12:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:16,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 10:12:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:16,277 INFO L225 Difference]: With dead ends: 44797 [2019-12-07 10:12:16,277 INFO L226 Difference]: Without dead ends: 44797 [2019-12-07 10:12:16,277 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 10:12:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44797 states. [2019-12-07 10:12:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44797 to 44797. [2019-12-07 10:12:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44797 states. [2019-12-07 10:12:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44797 states to 44797 states and 143334 transitions. [2019-12-07 10:12:16,926 INFO L78 Accepts]: Start accepts. Automaton has 44797 states and 143334 transitions. Word has length 43 [2019-12-07 10:12:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:16,926 INFO L462 AbstractCegarLoop]: Abstraction has 44797 states and 143334 transitions. [2019-12-07 10:12:16,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44797 states and 143334 transitions. [2019-12-07 10:12:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:12:16,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:16,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:16,972 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2052165658, now seen corresponding path program 1 times [2019-12-07 10:12:16,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:16,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969099808] [2019-12-07 10:12:16,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:17,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969099808] [2019-12-07 10:12:17,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:17,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:17,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138045209] [2019-12-07 10:12:17,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:17,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:17,134 INFO L87 Difference]: Start difference. First operand 44797 states and 143334 transitions. Second operand 6 states. [2019-12-07 10:12:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:17,315 INFO L93 Difference]: Finished difference Result 42334 states and 137549 transitions. [2019-12-07 10:12:17,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:12:17,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 10:12:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:17,371 INFO L225 Difference]: With dead ends: 42334 [2019-12-07 10:12:17,372 INFO L226 Difference]: Without dead ends: 42054 [2019-12-07 10:12:17,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:12:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42054 states. [2019-12-07 10:12:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42054 to 36230. [2019-12-07 10:12:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36230 states. [2019-12-07 10:12:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36230 states to 36230 states and 119073 transitions. [2019-12-07 10:12:17,966 INFO L78 Accepts]: Start accepts. Automaton has 36230 states and 119073 transitions. Word has length 51 [2019-12-07 10:12:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:17,966 INFO L462 AbstractCegarLoop]: Abstraction has 36230 states and 119073 transitions. [2019-12-07 10:12:17,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 36230 states and 119073 transitions. [2019-12-07 10:12:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:12:18,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:18,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:18,005 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash 288228535, now seen corresponding path program 1 times [2019-12-07 10:12:18,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254528236] [2019-12-07 10:12:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:18,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254528236] [2019-12-07 10:12:18,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:18,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:12:18,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406649094] [2019-12-07 10:12:18,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:18,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:18,076 INFO L87 Difference]: Start difference. First operand 36230 states and 119073 transitions. Second operand 6 states. [2019-12-07 10:12:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:19,112 INFO L93 Difference]: Finished difference Result 49278 states and 157317 transitions. [2019-12-07 10:12:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:12:19,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 10:12:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:19,185 INFO L225 Difference]: With dead ends: 49278 [2019-12-07 10:12:19,185 INFO L226 Difference]: Without dead ends: 49278 [2019-12-07 10:12:19,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:12:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-07 10:12:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 38709. [2019-12-07 10:12:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38709 states. [2019-12-07 10:12:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38709 states to 38709 states and 126673 transitions. [2019-12-07 10:12:19,879 INFO L78 Accepts]: Start accepts. Automaton has 38709 states and 126673 transitions. Word has length 67 [2019-12-07 10:12:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:19,879 INFO L462 AbstractCegarLoop]: Abstraction has 38709 states and 126673 transitions. [2019-12-07 10:12:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38709 states and 126673 transitions. [2019-12-07 10:12:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:12:19,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:19,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:19,920 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -490391891, now seen corresponding path program 2 times [2019-12-07 10:12:19,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:19,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891366446] [2019-12-07 10:12:19,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:19,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891366446] [2019-12-07 10:12:19,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:19,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:12:19,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597189133] [2019-12-07 10:12:19,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:19,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:19,954 INFO L87 Difference]: Start difference. First operand 38709 states and 126673 transitions. Second operand 3 states. [2019-12-07 10:12:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:20,128 INFO L93 Difference]: Finished difference Result 46717 states and 149651 transitions. [2019-12-07 10:12:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:20,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 10:12:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:20,187 INFO L225 Difference]: With dead ends: 46717 [2019-12-07 10:12:20,187 INFO L226 Difference]: Without dead ends: 46717 [2019-12-07 10:12:20,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46717 states. [2019-12-07 10:12:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46717 to 40184. [2019-12-07 10:12:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40184 states. [2019-12-07 10:12:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40184 states to 40184 states and 129939 transitions. [2019-12-07 10:12:20,896 INFO L78 Accepts]: Start accepts. Automaton has 40184 states and 129939 transitions. Word has length 67 [2019-12-07 10:12:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:20,896 INFO L462 AbstractCegarLoop]: Abstraction has 40184 states and 129939 transitions. [2019-12-07 10:12:20,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40184 states and 129939 transitions. [2019-12-07 10:12:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:12:20,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:20,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:20,937 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -471096443, now seen corresponding path program 1 times [2019-12-07 10:12:20,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:20,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516060598] [2019-12-07 10:12:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:20,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516060598] [2019-12-07 10:12:20,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:20,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:20,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290498025] [2019-12-07 10:12:20,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:20,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:20,973 INFO L87 Difference]: Start difference. First operand 40184 states and 129939 transitions. Second operand 3 states. [2019-12-07 10:12:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:21,088 INFO L93 Difference]: Finished difference Result 40183 states and 129937 transitions. [2019-12-07 10:12:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:21,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 10:12:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:21,138 INFO L225 Difference]: With dead ends: 40183 [2019-12-07 10:12:21,138 INFO L226 Difference]: Without dead ends: 40183 [2019-12-07 10:12:21,139 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 10:12:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40183 states. [2019-12-07 10:12:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40183 to 40183. [2019-12-07 10:12:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40183 states. [2019-12-07 10:12:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40183 states to 40183 states and 129937 transitions. [2019-12-07 10:12:21,721 INFO L78 Accepts]: Start accepts. Automaton has 40183 states and 129937 transitions. Word has length 68 [2019-12-07 10:12:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:21,721 INFO L462 AbstractCegarLoop]: Abstraction has 40183 states and 129937 transitions. [2019-12-07 10:12:21,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 40183 states and 129937 transitions. [2019-12-07 10:12:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 10:12:21,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:21,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:21,765 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1732230147, now seen corresponding path program 1 times [2019-12-07 10:12:21,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:21,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353385133] [2019-12-07 10:12:21,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:21,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353385133] [2019-12-07 10:12:21,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:21,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:12:21,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384394378] [2019-12-07 10:12:21,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:21,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:21,807 INFO L87 Difference]: Start difference. First operand 40183 states and 129937 transitions. Second operand 3 states. [2019-12-07 10:12:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:21,920 INFO L93 Difference]: Finished difference Result 39997 states and 127783 transitions. [2019-12-07 10:12:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:21,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 10:12:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:21,970 INFO L225 Difference]: With dead ends: 39997 [2019-12-07 10:12:21,971 INFO L226 Difference]: Without dead ends: 39997 [2019-12-07 10:12:21,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39997 states. [2019-12-07 10:12:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39997 to 38313. [2019-12-07 10:12:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38313 states. [2019-12-07 10:12:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38313 states to 38313 states and 122735 transitions. [2019-12-07 10:12:22,545 INFO L78 Accepts]: Start accepts. Automaton has 38313 states and 122735 transitions. Word has length 69 [2019-12-07 10:12:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:22,545 INFO L462 AbstractCegarLoop]: Abstraction has 38313 states and 122735 transitions. [2019-12-07 10:12:22,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38313 states and 122735 transitions. [2019-12-07 10:12:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:22,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:22,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:22,585 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1259026202, now seen corresponding path program 1 times [2019-12-07 10:12:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:22,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624417038] [2019-12-07 10:12:22,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:22,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624417038] [2019-12-07 10:12:22,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:22,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:22,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032916509] [2019-12-07 10:12:22,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:22,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:22,623 INFO L87 Difference]: Start difference. First operand 38313 states and 122735 transitions. Second operand 3 states. [2019-12-07 10:12:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:22,856 INFO L93 Difference]: Finished difference Result 44257 states and 142123 transitions. [2019-12-07 10:12:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:22,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 10:12:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:22,914 INFO L225 Difference]: With dead ends: 44257 [2019-12-07 10:12:22,914 INFO L226 Difference]: Without dead ends: 44257 [2019-12-07 10:12:22,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44257 states. [2019-12-07 10:12:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44257 to 37683. [2019-12-07 10:12:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37683 states. [2019-12-07 10:12:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37683 states to 37683 states and 120358 transitions. [2019-12-07 10:12:23,562 INFO L78 Accepts]: Start accepts. Automaton has 37683 states and 120358 transitions. Word has length 70 [2019-12-07 10:12:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:23,562 INFO L462 AbstractCegarLoop]: Abstraction has 37683 states and 120358 transitions. [2019-12-07 10:12:23,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37683 states and 120358 transitions. [2019-12-07 10:12:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:23,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:23,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:23,600 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1623819996, now seen corresponding path program 2 times [2019-12-07 10:12:23,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:23,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682433447] [2019-12-07 10:12:23,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:23,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682433447] [2019-12-07 10:12:23,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:23,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:12:23,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446710829] [2019-12-07 10:12:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:23,674 INFO L87 Difference]: Start difference. First operand 37683 states and 120358 transitions. Second operand 6 states. [2019-12-07 10:12:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:23,878 INFO L93 Difference]: Finished difference Result 65688 states and 209169 transitions. [2019-12-07 10:12:23,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:12:23,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 10:12:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:23,918 INFO L225 Difference]: With dead ends: 65688 [2019-12-07 10:12:23,918 INFO L226 Difference]: Without dead ends: 32265 [2019-12-07 10:12:23,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:12:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32265 states. [2019-12-07 10:12:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32265 to 32109. [2019-12-07 10:12:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32109 states. [2019-12-07 10:12:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32109 states to 32109 states and 102025 transitions. [2019-12-07 10:12:24,391 INFO L78 Accepts]: Start accepts. Automaton has 32109 states and 102025 transitions. Word has length 70 [2019-12-07 10:12:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:24,391 INFO L462 AbstractCegarLoop]: Abstraction has 32109 states and 102025 transitions. [2019-12-07 10:12:24,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32109 states and 102025 transitions. [2019-12-07 10:12:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:24,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:24,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:24,424 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1271874620, now seen corresponding path program 1 times [2019-12-07 10:12:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:24,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892985879] [2019-12-07 10:12:24,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:24,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892985879] [2019-12-07 10:12:24,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:24,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:24,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774292937] [2019-12-07 10:12:24,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:12:24,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:12:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:12:24,459 INFO L87 Difference]: Start difference. First operand 32109 states and 102025 transitions. Second operand 4 states. [2019-12-07 10:12:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:24,592 INFO L93 Difference]: Finished difference Result 32103 states and 101532 transitions. [2019-12-07 10:12:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:12:24,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 10:12:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:24,634 INFO L225 Difference]: With dead ends: 32103 [2019-12-07 10:12:24,634 INFO L226 Difference]: Without dead ends: 32103 [2019-12-07 10:12:24,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32103 states. [2019-12-07 10:12:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32103 to 27016. [2019-12-07 10:12:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27016 states. [2019-12-07 10:12:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27016 states to 27016 states and 85098 transitions. [2019-12-07 10:12:25,088 INFO L78 Accepts]: Start accepts. Automaton has 27016 states and 85098 transitions. Word has length 70 [2019-12-07 10:12:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:25,089 INFO L462 AbstractCegarLoop]: Abstraction has 27016 states and 85098 transitions. [2019-12-07 10:12:25,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:12:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27016 states and 85098 transitions. [2019-12-07 10:12:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:25,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:25,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:25,117 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash -182208042, now seen corresponding path program 3 times [2019-12-07 10:12:25,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:25,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170926065] [2019-12-07 10:12:25,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:12:25,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170926065] [2019-12-07 10:12:25,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:25,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:25,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114504473] [2019-12-07 10:12:25,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:25,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:25,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:25,180 INFO L87 Difference]: Start difference. First operand 27016 states and 85098 transitions. Second operand 6 states. [2019-12-07 10:12:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:25,298 INFO L93 Difference]: Finished difference Result 33644 states and 103840 transitions. [2019-12-07 10:12:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:12:25,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 10:12:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:25,300 INFO L225 Difference]: With dead ends: 33644 [2019-12-07 10:12:25,300 INFO L226 Difference]: Without dead ends: 2465 [2019-12-07 10:12:25,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:12:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2019-12-07 10:12:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2462. [2019-12-07 10:12:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-12-07 10:12:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 6857 transitions. [2019-12-07 10:12:25,329 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 6857 transitions. Word has length 70 [2019-12-07 10:12:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:25,329 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 6857 transitions. [2019-12-07 10:12:25,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 6857 transitions. [2019-12-07 10:12:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:25,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:25,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:25,331 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1986817882, now seen corresponding path program 4 times [2019-12-07 10:12:25,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:25,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152510699] [2019-12-07 10:12:25,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:12:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:12:25,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:12:25,425 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:12:25,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1263] [1263] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse1 (store |v_#valid_68| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_142| 1))) (and (= v_~x$r_buff1_thd0~0_205 0) (= v_~__unbuffered_cnt~0_108 0) (= 0 v_~weak$$choice2~0_82) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 (select (select |v_#memory_int_273| |v_~#x~0.base_142|) |v_~#x~0.offset_142|)) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~x$w_buff0_used~0_1161 0) (= |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0) (= 0 v_~x$r_buff0_thd3~0_136) (= |v_#memory_int_272| (store |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22| (store (select |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22|) |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0))) (= 0 v_~__unbuffered_p0_EAX~0_148) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~y~0_143 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1988~0.base_22|) (= v_~x$r_buff0_thd1~0_232 0) (= v_~main$tmp_guard1~0_28 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (< |v_#StackHeapBarrier_21| |v_~#x~0.base_142|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32 0) (= 0 v_~weak$$choice1~0_86) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$flush_delayed~0_20 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_687) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff1_thd2~0_538) (= v_~__unbuffered_p1_EAX$read_delayed~0_51 0) (= 0 v_~weak$$choice0~0_163) (= 0 v_~x$w_buff0~0_371) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (= v_~x$mem_tmp~0_13 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22|) 0) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_142| 4) |v_ULTIMATE.start_main_~#t1988~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 v_~x$r_buff0_thd2~0_529) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~x$w_buff1~0_270) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_6 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22| 1)) (= (select .cse1 |v_~#x~0.base_142|) 0) (= v_~x$r_buff0_thd0~0_105 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~main$tmp_guard0~0_38 0) (= 0 |v_~#x~0.offset_142|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_273|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_371, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_136, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_148, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ULTIMATE.start_main_~#t1988~0.base=|v_ULTIMATE.start_main_~#t1988~0.base_22|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32, #length=|v_#length_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6, ~#x~0.offset=|v_~#x~0.offset_142|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_687, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_538, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_81|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_35|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_71|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_163, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_83|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_61|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_17|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_26|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_6, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_51, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_59|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_22|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_32|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_529, ULTIMATE.start_main_~#t1988~0.offset=|v_ULTIMATE.start_main_~#t1988~0.offset_18|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1161, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_42|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_272|, ~#x~0.base=|v_~#x~0.base_142|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_82, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ULTIMATE.start_main_~#t1988~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1990~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_~#t1989~0.base, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ULTIMATE.start_main_~#t1990~0.base, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1988~0.offset, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1989~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:12:25,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L835-1-->L837: Formula: (and (= (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11|) |v_ULTIMATE.start_main_~#t1989~0.offset_10| 1)) |v_#memory_int_191|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1989~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1989~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1989~0.base_11|) (= |v_ULTIMATE.start_main_~#t1989~0.offset_10| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_192|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_191|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_10|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1989~0.offset, ULTIMATE.start_main_~#t1989~0.base] because there is no mapped edge [2019-12-07 10:12:25,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1990~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1990~0.base_13|) (= (store |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13| (store (select |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13|) |v_ULTIMATE.start_main_~#t1990~0.offset_11| 2)) |v_#memory_int_219|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1990~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1990~0.base_13| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_220|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_11|, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_219|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0.offset, ULTIMATE.start_main_~#t1990~0.base, ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:12:25,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L780-->L780-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1580553678 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite33_In-1580553678| |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|) (= ~x$w_buff1~0_In-1580553678 |P1Thread1of1ForFork0_#t~ite34_Out-1580553678|) (not .cse0)) (and .cse0 (= (mod ~x$w_buff0_used~0_In-1580553678 256) 0) (= ~x$w_buff1~0_In-1580553678 |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|) (= |P1Thread1of1ForFork0_#t~ite34_Out-1580553678| |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1580553678, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_In-1580553678|, ~weak$$choice2~0=~weak$$choice2~0_In-1580553678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580553678} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1580553678, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-1580553678|, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-1580553678|, ~weak$$choice2~0=~weak$$choice2~0_In-1580553678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580553678} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite33, P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:12:25,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L783-->L784: Formula: (and (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_6|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:12:25,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L784-->L784-17: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-479414334 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-479414334| ~x$r_buff1_thd2~0_In-479414334) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_In-479414334| |P1Thread1of1ForFork0_#t~ite54_Out-479414334|)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out-479414334| |P1Thread1of1ForFork0_#t~ite55_Out-479414334|) (= (mod ~x$w_buff0_used~0_In-479414334 256) 0) .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-479414334| ~x$r_buff1_thd2~0_In-479414334)))) InVars {P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_In-479414334|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-479414334, ~weak$$choice2~0=~weak$$choice2~0_In-479414334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479414334} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-479414334|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-479414334, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-479414334|, ~weak$$choice2~0=~weak$$choice2~0_In-479414334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479414334} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54, P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 10:12:25,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1146] [1146] L788-->L795: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~y~0_35 1) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= (store |v_#memory_int_99| |v_~#x~0.base_55| (store (select |v_#memory_int_99| |v_~#x~0.base_55|) |v_~#x~0.offset_55| v_~x$mem_tmp~0_7)) |v_#memory_int_98|)) InVars {~#x~0.offset=|v_~#x~0.offset_55|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, #memory_int=|v_#memory_int_99|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~#x~0.offset=|v_~#x~0.offset_55|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_98|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 10:12:25,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L795-2-->L795-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1390752777 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1390752777 256) 0)) (.cse1 (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| |P1Thread1of1ForFork0_#t~ite61_Out1390752777|))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~mem59_In1390752777| |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| ~x$w_buff1~0_In1390752777) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) (or .cse2 .cse0) (= (select (select |#memory_int_In1390752777| |~#x~0.base_In1390752777|) |~#x~0.offset_In1390752777|) |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) .cse1))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1390752777|, ~#x~0.offset=|~#x~0.offset_In1390752777|, ~x$w_buff1~0=~x$w_buff1~0_In1390752777, ~#x~0.base=|~#x~0.base_In1390752777|, #memory_int=|#memory_int_In1390752777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390752777, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1390752777} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1390752777|, ~#x~0.offset=|~#x~0.offset_In1390752777|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1390752777|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1390752777|, ~x$w_buff1~0=~x$w_buff1~0_In1390752777, ~#x~0.base=|~#x~0.base_In1390752777|, #memory_int=|#memory_int_In1390752777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390752777, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1390752777} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 10:12:25,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1153] [1153] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In170571138 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In170571138 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out170571138| ~x$w_buff0_used~0_In170571138)) (and (= |P1Thread1of1ForFork0_#t~ite62_Out170571138| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170571138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170571138} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out170571138|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170571138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170571138} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 10:12:25,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In508255251 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In508255251 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In508255251 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In508255251 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite63_Out508255251| ~x$w_buff1_used~0_In508255251) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite63_Out508255251| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In508255251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In508255251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In508255251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508255251} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out508255251|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In508255251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In508255251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In508255251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508255251} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 10:12:25,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1573639319 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1573639319 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite64_Out1573639319| 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1573639319 |P1Thread1of1ForFork0_#t~ite64_Out1573639319|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out1573639319|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 10:12:25,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1397489245 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1397489245 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1397489245 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1397489245 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out1397489245| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite65_Out1397489245| ~x$r_buff1_thd2~0_In1397489245) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1397489245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1397489245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1397489245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1397489245} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out1397489245|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1397489245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1397489245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1397489245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1397489245} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 10:12:25,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~x$r_buff1_thd2~0_410 |v_P1Thread1of1ForFork0_#t~ite65_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_410, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:12:25,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] P0ENTRY-->L4-3: Formula: (and (= v_~y~0_12 v_~__unbuffered_p0_EAX~0_11) (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~x$w_buff0~0_32) (= 1 v_~x$w_buff0_used~0_135) (= v_~x$w_buff0~0_33 v_~x$w_buff1~0_25) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8| v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_72 v_~x$w_buff0_used~0_136) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_135 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_72 256))))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:12:25,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1672611739 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1672611739 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out1672611739| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out1672611739| ~x$w_buff0_used~0_In1672611739)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672611739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672611739, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1672611739|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 10:12:25,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1928204703 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1928204703 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1928204703 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1928204703 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out1928204703| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1928204703 |P0Thread1of1ForFork2_#t~ite7_Out1928204703|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1928204703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1928204703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1928204703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1928204703} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1928204703, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1928204703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1928204703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1928204703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1928204703} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 10:12:25,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L762-->L763: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1250557277 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1250557277 256) 0)) (.cse0 (= ~x$r_buff0_thd1~0_In1250557277 ~x$r_buff0_thd1~0_Out1250557277))) (or (and .cse0 .cse1) (and (= 0 ~x$r_buff0_thd1~0_Out1250557277) (not .cse1) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1250557277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250557277} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1250557277, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1250557277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250557277} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 10:12:25,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1464247871 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1464247871 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1464247871 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1464247871 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite9_Out1464247871| ~x$r_buff1_thd1~0_In1464247871)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite9_Out1464247871| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1464247871, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1464247871, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1464247871, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1464247871} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1464247871, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1464247871, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1464247871, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1464247871|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1464247871} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:12:25,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L763-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_141) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_141, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:12:25,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out1833619284| |P2Thread1of1ForFork1_#t~ite67_Out1833619284|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1833619284 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1833619284 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_In1833619284| |P2Thread1of1ForFork1_#t~mem66_Out1833619284|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite67_Out1833619284| ~x$w_buff1~0_In1833619284) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= (select (select |#memory_int_In1833619284| |~#x~0.base_In1833619284|) |~#x~0.offset_In1833619284|) |P2Thread1of1ForFork1_#t~mem66_Out1833619284|) (= |P2Thread1of1ForFork1_#t~mem66_Out1833619284| |P2Thread1of1ForFork1_#t~ite67_Out1833619284|)))) InVars {~#x~0.offset=|~#x~0.offset_In1833619284|, ~x$w_buff1~0=~x$w_buff1~0_In1833619284, ~#x~0.base=|~#x~0.base_In1833619284|, #memory_int=|#memory_int_In1833619284|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833619284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1833619284, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In1833619284|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out1833619284|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out1833619284|, ~#x~0.offset=|~#x~0.offset_In1833619284|, ~x$w_buff1~0=~x$w_buff1~0_In1833619284, ~#x~0.base=|~#x~0.base_In1833619284|, #memory_int=|#memory_int_In1833619284|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833619284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1833619284, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out1833619284|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 10:12:25,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1302995676 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1302995676 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1302995676 |P2Thread1of1ForFork1_#t~ite69_Out-1302995676|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite69_Out-1302995676|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1302995676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1302995676} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-1302995676|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1302995676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1302995676} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 10:12:25,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2027853395 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2027853395 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In2027853395 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2027853395 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out2027853395|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In2027853395 |P2Thread1of1ForFork1_#t~ite70_Out2027853395|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2027853395, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2027853395, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027853395, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027853395} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2027853395, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2027853395, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027853395, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out2027853395|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027853395} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 10:12:25,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In667401487 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In667401487 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite71_Out667401487|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In667401487 |P2Thread1of1ForFork1_#t~ite71_Out667401487|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In667401487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In667401487} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out667401487|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In667401487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In667401487} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 10:12:25,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1819634427 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1819634427 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1819634427 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1819634427 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-1819634427| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite72_Out-1819634427| ~x$r_buff1_thd3~0_In-1819634427)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1819634427, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1819634427, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1819634427, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1819634427} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1819634427, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1819634427, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1819634427, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-1819634427|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1819634427} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 10:12:25,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L816-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_42| v_~x$r_buff1_thd3~0_167) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:12:25,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L843-->L845-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_201 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:12:25,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In822947623 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In822947623 256) 0))) (or (and (= ~x$w_buff1~0_In822947623 |ULTIMATE.start_main_#t~ite77_Out822947623|) (not .cse0) (= |ULTIMATE.start_main_#t~mem76_In822947623| |ULTIMATE.start_main_#t~mem76_Out822947623|) (not .cse1)) (and (= (select (select |#memory_int_In822947623| |~#x~0.base_In822947623|) |~#x~0.offset_In822947623|) |ULTIMATE.start_main_#t~mem76_Out822947623|) (= |ULTIMATE.start_main_#t~mem76_Out822947623| |ULTIMATE.start_main_#t~ite77_Out822947623|) (or .cse1 .cse0)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In822947623|, ~#x~0.offset=|~#x~0.offset_In822947623|, ~x$w_buff1~0=~x$w_buff1~0_In822947623, ~#x~0.base=|~#x~0.base_In822947623|, #memory_int=|#memory_int_In822947623|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In822947623, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In822947623} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out822947623|, ~#x~0.offset=|~#x~0.offset_In822947623|, ~x$w_buff1~0=~x$w_buff1~0_In822947623, ~#x~0.base=|~#x~0.base_In822947623|, #memory_int=|#memory_int_In822947623|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In822947623, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out822947623|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In822947623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 10:12:25,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L845-4-->L846: Formula: (= (store |v_#memory_int_78| |v_~#x~0.base_46| (store (select |v_#memory_int_78| |v_~#x~0.base_46|) |v_~#x~0.offset_46| |v_ULTIMATE.start_main_#t~ite77_11|)) |v_#memory_int_77|) InVars {~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|} OutVars{ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_6|, ~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_77|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_10|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, #memory_int, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 10:12:25,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-642850838 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-642850838 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite79_Out-642850838|)) (and (= ~x$w_buff0_used~0_In-642850838 |ULTIMATE.start_main_#t~ite79_Out-642850838|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-642850838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-642850838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-642850838, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out-642850838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-642850838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 10:12:25,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1150] [1150] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In2026685733 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2026685733 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2026685733 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2026685733 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2026685733 |ULTIMATE.start_main_#t~ite80_Out2026685733|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite80_Out2026685733|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2026685733, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2026685733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2026685733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2026685733} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2026685733, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out2026685733|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2026685733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2026685733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2026685733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 10:12:25,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In110833195 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In110833195 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out110833195|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite81_Out110833195| ~x$r_buff0_thd0~0_In110833195)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110833195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110833195, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out110833195|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 10:12:25,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1499894314 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1499894314 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1499894314 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1499894314 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite82_Out1499894314| 0)) (and (= |ULTIMATE.start_main_#t~ite82_Out1499894314| ~x$r_buff1_thd0~0_In1499894314) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499894314, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499894314, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1499894314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499894314} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499894314, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out1499894314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499894314, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1499894314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499894314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 10:12:25,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In1231205470 256) 0)) (.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In1231205470 256) 0)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem84_In1231205470| |ULTIMATE.start_main_#t~mem84_Out1231205470|) .cse1 (= ~__unbuffered_p1_EAX~0_In1231205470 |ULTIMATE.start_main_#t~ite85_Out1231205470|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out1231205470| |ULTIMATE.start_main_#t~ite85_Out1231205470|) .cse1 (= (select (select |#memory_int_In1231205470| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470) |ULTIMATE.start_main_#t~mem84_Out1231205470|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1231205470, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470, #memory_int=|#memory_int_In1231205470|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In1231205470|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out1231205470|, ~weak$$choice1~0=~weak$$choice1~0_In1231205470, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470, #memory_int=|#memory_int_In1231205470|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out1231205470|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 10:12:25,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1205] [1205] L853-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_15 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_15 1)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse0 (= |v_ULTIMATE.start_main_#t~ite85_26| v_~__unbuffered_p1_EAX~0_32)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_62)) (.cse1 (= v_~y~0_65 2))) (or (and .cse0 (not .cse1) .cse2) (and (not .cse3) .cse0 .cse2) (and (not .cse4) .cse0 .cse2) (and (= v_~main$tmp_guard1~0_15 0) .cse3 .cse0 .cse4 .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_26|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~y~0=v_~y~0_65} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y~0=v_~y~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 10:12:25,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:12:25,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:12:25 BasicIcfg [2019-12-07 10:12:25,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:12:25,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:12:25,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:12:25,515 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:12:25,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31" (3/4) ... [2019-12-07 10:12:25,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:12:25,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1263] [1263] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse1 (store |v_#valid_68| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_142| 1))) (and (= v_~x$r_buff1_thd0~0_205 0) (= v_~__unbuffered_cnt~0_108 0) (= 0 v_~weak$$choice2~0_82) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 (select (select |v_#memory_int_273| |v_~#x~0.base_142|) |v_~#x~0.offset_142|)) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~x$w_buff0_used~0_1161 0) (= |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0) (= 0 v_~x$r_buff0_thd3~0_136) (= |v_#memory_int_272| (store |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22| (store (select |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22|) |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0))) (= 0 v_~__unbuffered_p0_EAX~0_148) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~y~0_143 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1988~0.base_22|) (= v_~x$r_buff0_thd1~0_232 0) (= v_~main$tmp_guard1~0_28 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (< |v_#StackHeapBarrier_21| |v_~#x~0.base_142|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32 0) (= 0 v_~weak$$choice1~0_86) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$flush_delayed~0_20 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_687) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff1_thd2~0_538) (= v_~__unbuffered_p1_EAX$read_delayed~0_51 0) (= 0 v_~weak$$choice0~0_163) (= 0 v_~x$w_buff0~0_371) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (= v_~x$mem_tmp~0_13 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22|) 0) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_142| 4) |v_ULTIMATE.start_main_~#t1988~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 v_~x$r_buff0_thd2~0_529) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~x$w_buff1~0_270) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_6 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22| 1)) (= (select .cse1 |v_~#x~0.base_142|) 0) (= v_~x$r_buff0_thd0~0_105 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~main$tmp_guard0~0_38 0) (= 0 |v_~#x~0.offset_142|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_273|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_371, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_136, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_148, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ULTIMATE.start_main_~#t1988~0.base=|v_ULTIMATE.start_main_~#t1988~0.base_22|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32, #length=|v_#length_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6, ~#x~0.offset=|v_~#x~0.offset_142|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_687, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_538, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_81|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_35|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_71|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_163, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_83|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_61|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_17|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_26|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_6, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_51, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_59|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_22|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_32|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_529, ULTIMATE.start_main_~#t1988~0.offset=|v_ULTIMATE.start_main_~#t1988~0.offset_18|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1161, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_42|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_272|, ~#x~0.base=|v_~#x~0.base_142|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_82, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ULTIMATE.start_main_~#t1988~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1990~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_~#t1989~0.base, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ULTIMATE.start_main_~#t1990~0.base, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1988~0.offset, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1989~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:12:25,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L835-1-->L837: Formula: (and (= (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11|) |v_ULTIMATE.start_main_~#t1989~0.offset_10| 1)) |v_#memory_int_191|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1989~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1989~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1989~0.base_11|) (= |v_ULTIMATE.start_main_~#t1989~0.offset_10| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_192|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_191|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_10|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1989~0.offset, ULTIMATE.start_main_~#t1989~0.base] because there is no mapped edge [2019-12-07 10:12:25,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1990~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1990~0.base_13|) (= (store |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13| (store (select |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13|) |v_ULTIMATE.start_main_~#t1990~0.offset_11| 2)) |v_#memory_int_219|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1990~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1990~0.base_13| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_220|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_11|, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_219|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0.offset, ULTIMATE.start_main_~#t1990~0.base, ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:12:25,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L780-->L780-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1580553678 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite33_In-1580553678| |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|) (= ~x$w_buff1~0_In-1580553678 |P1Thread1of1ForFork0_#t~ite34_Out-1580553678|) (not .cse0)) (and .cse0 (= (mod ~x$w_buff0_used~0_In-1580553678 256) 0) (= ~x$w_buff1~0_In-1580553678 |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|) (= |P1Thread1of1ForFork0_#t~ite34_Out-1580553678| |P1Thread1of1ForFork0_#t~ite33_Out-1580553678|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1580553678, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_In-1580553678|, ~weak$$choice2~0=~weak$$choice2~0_In-1580553678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580553678} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1580553678, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-1580553678|, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-1580553678|, ~weak$$choice2~0=~weak$$choice2~0_In-1580553678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580553678} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite33, P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 10:12:25,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L783-->L784: Formula: (and (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_6|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:12:25,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L784-->L784-17: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-479414334 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-479414334| ~x$r_buff1_thd2~0_In-479414334) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_In-479414334| |P1Thread1of1ForFork0_#t~ite54_Out-479414334|)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out-479414334| |P1Thread1of1ForFork0_#t~ite55_Out-479414334|) (= (mod ~x$w_buff0_used~0_In-479414334 256) 0) .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-479414334| ~x$r_buff1_thd2~0_In-479414334)))) InVars {P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_In-479414334|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-479414334, ~weak$$choice2~0=~weak$$choice2~0_In-479414334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479414334} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-479414334|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-479414334, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-479414334|, ~weak$$choice2~0=~weak$$choice2~0_In-479414334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479414334} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54, P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 10:12:25,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1146] [1146] L788-->L795: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~y~0_35 1) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= (store |v_#memory_int_99| |v_~#x~0.base_55| (store (select |v_#memory_int_99| |v_~#x~0.base_55|) |v_~#x~0.offset_55| v_~x$mem_tmp~0_7)) |v_#memory_int_98|)) InVars {~#x~0.offset=|v_~#x~0.offset_55|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, #memory_int=|v_#memory_int_99|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~#x~0.offset=|v_~#x~0.offset_55|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_98|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 10:12:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L795-2-->L795-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1390752777 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1390752777 256) 0)) (.cse1 (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| |P1Thread1of1ForFork0_#t~ite61_Out1390752777|))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~mem59_In1390752777| |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| ~x$w_buff1~0_In1390752777) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out1390752777| |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) (or .cse2 .cse0) (= (select (select |#memory_int_In1390752777| |~#x~0.base_In1390752777|) |~#x~0.offset_In1390752777|) |P1Thread1of1ForFork0_#t~mem59_Out1390752777|) .cse1))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1390752777|, ~#x~0.offset=|~#x~0.offset_In1390752777|, ~x$w_buff1~0=~x$w_buff1~0_In1390752777, ~#x~0.base=|~#x~0.base_In1390752777|, #memory_int=|#memory_int_In1390752777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390752777, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1390752777} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1390752777|, ~#x~0.offset=|~#x~0.offset_In1390752777|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1390752777|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1390752777|, ~x$w_buff1~0=~x$w_buff1~0_In1390752777, ~#x~0.base=|~#x~0.base_In1390752777|, #memory_int=|#memory_int_In1390752777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390752777, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1390752777} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 10:12:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1153] [1153] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In170571138 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In170571138 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out170571138| ~x$w_buff0_used~0_In170571138)) (and (= |P1Thread1of1ForFork0_#t~ite62_Out170571138| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170571138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170571138} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out170571138|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170571138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170571138} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 10:12:25,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In508255251 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In508255251 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In508255251 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In508255251 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite63_Out508255251| ~x$w_buff1_used~0_In508255251) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite63_Out508255251| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In508255251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In508255251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In508255251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508255251} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out508255251|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In508255251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In508255251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In508255251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508255251} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 10:12:25,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1573639319 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1573639319 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite64_Out1573639319| 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1573639319 |P1Thread1of1ForFork0_#t~ite64_Out1573639319|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out1573639319|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 10:12:25,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1397489245 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1397489245 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1397489245 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1397489245 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out1397489245| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite65_Out1397489245| ~x$r_buff1_thd2~0_In1397489245) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1397489245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1397489245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1397489245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1397489245} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out1397489245|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1397489245, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1397489245, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1397489245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1397489245} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 10:12:25,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~x$r_buff1_thd2~0_410 |v_P1Thread1of1ForFork0_#t~ite65_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_410, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:12:25,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] P0ENTRY-->L4-3: Formula: (and (= v_~y~0_12 v_~__unbuffered_p0_EAX~0_11) (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~x$w_buff0~0_32) (= 1 v_~x$w_buff0_used~0_135) (= v_~x$w_buff0~0_33 v_~x$w_buff1~0_25) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8| v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_72 v_~x$w_buff0_used~0_136) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_135 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_72 256))))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:12:25,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1672611739 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1672611739 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out1672611739| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out1672611739| ~x$w_buff0_used~0_In1672611739)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672611739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1672611739, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1672611739|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 10:12:25,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1928204703 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1928204703 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1928204703 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1928204703 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out1928204703| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1928204703 |P0Thread1of1ForFork2_#t~ite7_Out1928204703|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1928204703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1928204703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1928204703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1928204703} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1928204703, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1928204703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1928204703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1928204703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1928204703} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 10:12:25,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L762-->L763: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1250557277 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1250557277 256) 0)) (.cse0 (= ~x$r_buff0_thd1~0_In1250557277 ~x$r_buff0_thd1~0_Out1250557277))) (or (and .cse0 .cse1) (and (= 0 ~x$r_buff0_thd1~0_Out1250557277) (not .cse1) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1250557277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250557277} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1250557277, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1250557277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250557277} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 10:12:25,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1464247871 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1464247871 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1464247871 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1464247871 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite9_Out1464247871| ~x$r_buff1_thd1~0_In1464247871)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite9_Out1464247871| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1464247871, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1464247871, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1464247871, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1464247871} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1464247871, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1464247871, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1464247871, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1464247871|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1464247871} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:12:25,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L763-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_141) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_141, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:12:25,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out1833619284| |P2Thread1of1ForFork1_#t~ite67_Out1833619284|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1833619284 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1833619284 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_In1833619284| |P2Thread1of1ForFork1_#t~mem66_Out1833619284|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite67_Out1833619284| ~x$w_buff1~0_In1833619284) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= (select (select |#memory_int_In1833619284| |~#x~0.base_In1833619284|) |~#x~0.offset_In1833619284|) |P2Thread1of1ForFork1_#t~mem66_Out1833619284|) (= |P2Thread1of1ForFork1_#t~mem66_Out1833619284| |P2Thread1of1ForFork1_#t~ite67_Out1833619284|)))) InVars {~#x~0.offset=|~#x~0.offset_In1833619284|, ~x$w_buff1~0=~x$w_buff1~0_In1833619284, ~#x~0.base=|~#x~0.base_In1833619284|, #memory_int=|#memory_int_In1833619284|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833619284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1833619284, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In1833619284|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out1833619284|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out1833619284|, ~#x~0.offset=|~#x~0.offset_In1833619284|, ~x$w_buff1~0=~x$w_buff1~0_In1833619284, ~#x~0.base=|~#x~0.base_In1833619284|, #memory_int=|#memory_int_In1833619284|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1833619284, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1833619284, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out1833619284|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 10:12:25,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1302995676 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1302995676 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1302995676 |P2Thread1of1ForFork1_#t~ite69_Out-1302995676|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite69_Out-1302995676|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1302995676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1302995676} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-1302995676|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1302995676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1302995676} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 10:12:25,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2027853395 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2027853395 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In2027853395 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2027853395 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out2027853395|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In2027853395 |P2Thread1of1ForFork1_#t~ite70_Out2027853395|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2027853395, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2027853395, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027853395, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027853395} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2027853395, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2027853395, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027853395, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out2027853395|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027853395} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 10:12:25,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In667401487 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In667401487 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite71_Out667401487|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In667401487 |P2Thread1of1ForFork1_#t~ite71_Out667401487|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In667401487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In667401487} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out667401487|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In667401487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In667401487} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 10:12:25,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1819634427 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1819634427 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1819634427 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1819634427 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-1819634427| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite72_Out-1819634427| ~x$r_buff1_thd3~0_In-1819634427)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1819634427, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1819634427, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1819634427, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1819634427} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1819634427, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1819634427, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1819634427, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-1819634427|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1819634427} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 10:12:25,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L816-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_42| v_~x$r_buff1_thd3~0_167) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:12:25,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L843-->L845-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_201 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:12:25,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In822947623 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In822947623 256) 0))) (or (and (= ~x$w_buff1~0_In822947623 |ULTIMATE.start_main_#t~ite77_Out822947623|) (not .cse0) (= |ULTIMATE.start_main_#t~mem76_In822947623| |ULTIMATE.start_main_#t~mem76_Out822947623|) (not .cse1)) (and (= (select (select |#memory_int_In822947623| |~#x~0.base_In822947623|) |~#x~0.offset_In822947623|) |ULTIMATE.start_main_#t~mem76_Out822947623|) (= |ULTIMATE.start_main_#t~mem76_Out822947623| |ULTIMATE.start_main_#t~ite77_Out822947623|) (or .cse1 .cse0)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In822947623|, ~#x~0.offset=|~#x~0.offset_In822947623|, ~x$w_buff1~0=~x$w_buff1~0_In822947623, ~#x~0.base=|~#x~0.base_In822947623|, #memory_int=|#memory_int_In822947623|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In822947623, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In822947623} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out822947623|, ~#x~0.offset=|~#x~0.offset_In822947623|, ~x$w_buff1~0=~x$w_buff1~0_In822947623, ~#x~0.base=|~#x~0.base_In822947623|, #memory_int=|#memory_int_In822947623|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In822947623, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out822947623|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In822947623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 10:12:25,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L845-4-->L846: Formula: (= (store |v_#memory_int_78| |v_~#x~0.base_46| (store (select |v_#memory_int_78| |v_~#x~0.base_46|) |v_~#x~0.offset_46| |v_ULTIMATE.start_main_#t~ite77_11|)) |v_#memory_int_77|) InVars {~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|} OutVars{ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_6|, ~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_77|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_10|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, #memory_int, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 10:12:25,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-642850838 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-642850838 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite79_Out-642850838|)) (and (= ~x$w_buff0_used~0_In-642850838 |ULTIMATE.start_main_#t~ite79_Out-642850838|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-642850838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-642850838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-642850838, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out-642850838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-642850838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 10:12:25,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1150] [1150] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In2026685733 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2026685733 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2026685733 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2026685733 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2026685733 |ULTIMATE.start_main_#t~ite80_Out2026685733|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite80_Out2026685733|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2026685733, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2026685733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2026685733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2026685733} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2026685733, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out2026685733|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2026685733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2026685733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2026685733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 10:12:25,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In110833195 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In110833195 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out110833195|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite81_Out110833195| ~x$r_buff0_thd0~0_In110833195)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110833195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110833195, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out110833195|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 10:12:25,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1499894314 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1499894314 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1499894314 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1499894314 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite82_Out1499894314| 0)) (and (= |ULTIMATE.start_main_#t~ite82_Out1499894314| ~x$r_buff1_thd0~0_In1499894314) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499894314, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499894314, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1499894314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499894314} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1499894314, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out1499894314|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1499894314, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1499894314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1499894314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 10:12:25,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In1231205470 256) 0)) (.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In1231205470 256) 0)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem84_In1231205470| |ULTIMATE.start_main_#t~mem84_Out1231205470|) .cse1 (= ~__unbuffered_p1_EAX~0_In1231205470 |ULTIMATE.start_main_#t~ite85_Out1231205470|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out1231205470| |ULTIMATE.start_main_#t~ite85_Out1231205470|) .cse1 (= (select (select |#memory_int_In1231205470| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470) |ULTIMATE.start_main_#t~mem84_Out1231205470|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1231205470, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470, #memory_int=|#memory_int_In1231205470|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In1231205470|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out1231205470|, ~weak$$choice1~0=~weak$$choice1~0_In1231205470, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1231205470, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1231205470, #memory_int=|#memory_int_In1231205470|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out1231205470|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1231205470} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 10:12:25,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1205] [1205] L853-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_15 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_15 1)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse0 (= |v_ULTIMATE.start_main_#t~ite85_26| v_~__unbuffered_p1_EAX~0_32)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_62)) (.cse1 (= v_~y~0_65 2))) (or (and .cse0 (not .cse1) .cse2) (and (not .cse3) .cse0 .cse2) (and (not .cse4) .cse0 .cse2) (and (= v_~main$tmp_guard1~0_15 0) .cse3 .cse0 .cse4 .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_26|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~y~0=v_~y~0_65} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y~0=v_~y~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 10:12:25,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:12:25,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2f94610-5e93-4b05-bca7-ccfdcc2f2dbd/bin/uautomizer/witness.graphml [2019-12-07 10:12:25,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:12:25,594 INFO L168 Benchmark]: Toolchain (without parser) took 294723.69 ms. Allocated memory was 1.0 GB in the beginning and 10.8 GB in the end (delta: 9.7 GB). Free memory was 935.4 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. [2019-12-07 10:12:25,594 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:12:25,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:25,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:12:25,595 INFO L168 Benchmark]: Boogie Preprocessor took 35.69 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 10:12:25,595 INFO L168 Benchmark]: RCFGBuilder took 477.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:25,595 INFO L168 Benchmark]: TraceAbstraction took 293665.74 ms. Allocated memory was 1.1 GB in the beginning and 10.8 GB in the end (delta: 9.6 GB). Free memory was 990.1 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 7.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:12:25,596 INFO L168 Benchmark]: Witness Printer took 78.60 ms. Allocated memory is still 10.8 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:25,597 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 477.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 293665.74 ms. Allocated memory was 1.1 GB in the beginning and 10.8 GB in the end (delta: 9.6 GB). Free memory was 990.1 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 7.8 GB. Max. memory is 11.5 GB. * Witness Printer took 78.60 ms. Allocated memory is still 10.8 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 234 ProgramPointsBefore, 117 ProgramPointsAfterwards, 292 TransitionsBefore, 144 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 72 ConcurrentYvCompositions, 35 ChoiceCompositions, 11616 VarBasedMoverChecksPositive, 324 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 168479 CheckedPairsTotal, 179 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L837] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 x$flush_delayed = weak$$choice2 [L776] EXPR 2 \read(x) [L776] 2 x$mem_tmp = x [L777] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L778] EXPR 2 \read(x) [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=10, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L779] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))=0, x={5:0}, x$flush_delayed=10, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L839] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))=0, x={5:0}, x$flush_delayed=10, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L780] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L781] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={5:0}, x$flush_delayed=10, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={5:0}, x$flush_delayed=10, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L784] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L785] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L786] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L787] EXPR 2 \read(x) [L787] 2 __unbuffered_p1_EAX = x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L809] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=10, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 293.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 81.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7503 SDtfs, 9597 SDslu, 14910 SDs, 0 SdLazy, 10877 SolverSat, 629 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 64 SyntacticMatches, 23 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470095occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 163.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 947459 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1090 ConstructedInterpolants, 0 QuantifiedInterpolants, 151219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...