./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.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_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/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 d10051af7e286b982df89e670765963a7af7eb7c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:56:23,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:56:23,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:56:23,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:56:23,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:56:23,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:56:23,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:56:23,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:56:23,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:56:23,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:56:23,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:56:23,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:56:23,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:56:23,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:56:23,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:56:23,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:56:23,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:56:23,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:56:23,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:56:23,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:56:23,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:56:23,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:56:23,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:56:23,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:56:23,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:56:23,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:56:23,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:56:23,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:56:23,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:56:23,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:56:23,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:56:23,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:56:23,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:56:23,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:56:23,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:56:23,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:56:23,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:56:23,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:56:23,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:56:23,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:56:23,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:56:23,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:56:23,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:56:23,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:56:23,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:56:23,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:56:23,261 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:56:23,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:56:23,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:56:23,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:56:23,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:56:23,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:56:23,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:56:23,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:56:23,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:56:23,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:56:23,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:56:23,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/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 -> d10051af7e286b982df89e670765963a7af7eb7c [2019-12-07 11:56:23,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:56:23,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:56:23,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:56:23,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:56:23,374 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:56:23,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-12-07 11:56:23,412 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/data/4d1973af7/d775135ad64549ec86a88d081c55f167/FLAGb329276b0 [2019-12-07 11:56:23,888 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:56:23,889 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-12-07 11:56:23,900 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/data/4d1973af7/d775135ad64549ec86a88d081c55f167/FLAGb329276b0 [2019-12-07 11:56:23,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/data/4d1973af7/d775135ad64549ec86a88d081c55f167 [2019-12-07 11:56:23,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:56:23,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:56:23,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:56:23,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:56:23,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:56:23,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:56:23" (1/1) ... [2019-12-07 11:56:23,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a394adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:23, skipping insertion in model container [2019-12-07 11:56:23,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:56:23" (1/1) ... [2019-12-07 11:56:23,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:56:23,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:56:24,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:56:24,189 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:56:24,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:56:24,288 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:56:24,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24 WrapperNode [2019-12-07 11:56:24,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:56:24,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:56:24,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:56:24,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:56:24,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:56:24,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:56:24,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:56:24,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:56:24,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... [2019-12-07 11:56:24,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:56:24,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:56:24,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:56:24,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:56:24,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/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 11:56:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:56:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:56:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:56:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:56:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:56:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:56:24,415 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 11:56:24,722 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:56:24,723 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:56:24,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:24 BoogieIcfgContainer [2019-12-07 11:56:24,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:56:24,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:56:24,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:56:24,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:56:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:56:23" (1/3) ... [2019-12-07 11:56:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cd2dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:56:24, skipping insertion in model container [2019-12-07 11:56:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:24" (2/3) ... [2019-12-07 11:56:24,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cd2dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:56:24, skipping insertion in model container [2019-12-07 11:56:24,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:24" (3/3) ... [2019-12-07 11:56:24,729 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.oepc.i [2019-12-07 11:56:24,735 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:56:24,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:56:24,740 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:56:24,740 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:56:24,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:56:24,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:56:24,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:56:24,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:56:24,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:56:24,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:56:24,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:56:24,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:56:24,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:56:24,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:56:24,824 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-07 11:56:24,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 11:56:24,875 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 11:56:24,875 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:56:24,885 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 11:56:24,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 11:56:24,929 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 11:56:24,929 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:56:24,933 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 11:56:24,944 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 11:56:24,945 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:56:27,432 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 11:56:27,521 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-07 11:56:27,521 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-07 11:56:27,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-07 11:56:27,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-07 11:56:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-07 11:56:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:56:27,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:27,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:27,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-07 11:56:27,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:27,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820571811] [2019-12-07 11:56:27,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:27,890 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 11:56:27,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820571811] [2019-12-07 11:56:27,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:27,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:56:27,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050775697] [2019-12-07 11:56:27,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:27,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:27,906 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-07 11:56:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:28,062 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-07 11:56:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:28,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:56:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:28,132 INFO L225 Difference]: With dead ends: 5990 [2019-12-07 11:56:28,132 INFO L226 Difference]: Without dead ends: 5642 [2019-12-07 11:56:28,133 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 11:56:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-07 11:56:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-07 11:56:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 11:56:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-07 11:56:28,333 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-07 11:56:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:28,333 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-07 11:56:28,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-07 11:56:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:56:28,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:28,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:28,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-07 11:56:28,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:28,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373145310] [2019-12-07 11:56:28,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:28,392 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 11:56:28,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373145310] [2019-12-07 11:56:28,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:28,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:28,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854841626] [2019-12-07 11:56:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:28,395 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-12-07 11:56:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:28,620 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-12-07 11:56:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:28,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:56:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:28,682 INFO L225 Difference]: With dead ends: 8500 [2019-12-07 11:56:28,682 INFO L226 Difference]: Without dead ends: 8487 [2019-12-07 11:56:28,682 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 11:56:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-07 11:56:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-12-07 11:56:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-07 11:56:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-12-07 11:56:28,874 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-12-07 11:56:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:28,875 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-12-07 11:56:28,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-12-07 11:56:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:56:28,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:28,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:28,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-07 11:56:28,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:28,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936262111] [2019-12-07 11:56:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:28,910 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 11:56:28,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936262111] [2019-12-07 11:56:28,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:28,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:28,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915758323] [2019-12-07 11:56:28,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:28,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:28,912 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-12-07 11:56:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:29,022 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-12-07 11:56:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:29,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 11:56:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:29,048 INFO L225 Difference]: With dead ends: 10006 [2019-12-07 11:56:29,048 INFO L226 Difference]: Without dead ends: 10006 [2019-12-07 11:56:29,048 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 11:56:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-12-07 11:56:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-12-07 11:56:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-12-07 11:56:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-12-07 11:56:29,262 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-12-07 11:56:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:29,262 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-12-07 11:56:29,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-12-07 11:56:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:56:29,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:29,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:29,265 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-07 11:56:29,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:29,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723209952] [2019-12-07 11:56:29,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:29,302 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 11:56:29,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723209952] [2019-12-07 11:56:29,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:29,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:29,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308491806] [2019-12-07 11:56:29,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:29,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:29,303 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-12-07 11:56:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:29,462 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-12-07 11:56:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:29,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:56:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:29,483 INFO L225 Difference]: With dead ends: 10925 [2019-12-07 11:56:29,483 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 11:56:29,483 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 11:56:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 11:56:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-12-07 11:56:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-12-07 11:56:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-12-07 11:56:29,663 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-12-07 11:56:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:29,663 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-12-07 11:56:29,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-12-07 11:56:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:56:29,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:29,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:29,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-07 11:56:29,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:29,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829745314] [2019-12-07 11:56:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:29,695 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 11:56:29,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829745314] [2019-12-07 11:56:29,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:29,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:29,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416038264] [2019-12-07 11:56:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:29,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:29,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:29,697 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-12-07 11:56:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:29,817 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-12-07 11:56:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:29,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:56:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:29,836 INFO L225 Difference]: With dead ends: 11905 [2019-12-07 11:56:29,836 INFO L226 Difference]: Without dead ends: 11891 [2019-12-07 11:56:29,836 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 11:56:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-07 11:56:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-12-07 11:56:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-12-07 11:56:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-12-07 11:56:30,041 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-12-07 11:56:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:30,041 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-12-07 11:56:30,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-12-07 11:56:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:56:30,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:30,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:30,044 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-12-07 11:56:30,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:30,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83026326] [2019-12-07 11:56:30,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:30,092 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 11:56:30,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83026326] [2019-12-07 11:56:30,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:30,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:56:30,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927171411] [2019-12-07 11:56:30,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:30,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:30,093 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-12-07 11:56:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:30,140 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-12-07 11:56:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:30,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 11:56:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:30,164 INFO L225 Difference]: With dead ends: 16550 [2019-12-07 11:56:30,164 INFO L226 Difference]: Without dead ends: 15886 [2019-12-07 11:56:30,164 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 11:56:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-07 11:56:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-12-07 11:56:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-12-07 11:56:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-12-07 11:56:30,412 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-12-07 11:56:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:30,412 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-12-07 11:56:30,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-12-07 11:56:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:56:30,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:30,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:30,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-12-07 11:56:30,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:30,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066974000] [2019-12-07 11:56:30,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:30,475 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 11:56:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066974000] [2019-12-07 11:56:30,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:30,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:30,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112948273] [2019-12-07 11:56:30,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:30,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:30,476 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 4 states. [2019-12-07 11:56:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:30,527 INFO L93 Difference]: Finished difference Result 15168 states and 50237 transitions. [2019-12-07 11:56:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:30,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 11:56:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:30,547 INFO L225 Difference]: With dead ends: 15168 [2019-12-07 11:56:30,547 INFO L226 Difference]: Without dead ends: 15052 [2019-12-07 11:56:30,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2019-12-07 11:56:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15052. [2019-12-07 11:56:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15052 states. [2019-12-07 11:56:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 49867 transitions. [2019-12-07 11:56:30,797 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 49867 transitions. Word has length 17 [2019-12-07 11:56:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:30,797 INFO L462 AbstractCegarLoop]: Abstraction has 15052 states and 49867 transitions. [2019-12-07 11:56:30,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 49867 transitions. [2019-12-07 11:56:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:56:30,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:30,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:30,803 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1452760467, now seen corresponding path program 1 times [2019-12-07 11:56:30,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:30,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217020100] [2019-12-07 11:56:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:30,825 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 11:56:30,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217020100] [2019-12-07 11:56:30,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:30,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451817709] [2019-12-07 11:56:30,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:30,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:30,826 INFO L87 Difference]: Start difference. First operand 15052 states and 49867 transitions. Second operand 3 states. [2019-12-07 11:56:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:30,837 INFO L93 Difference]: Finished difference Result 2168 states and 5337 transitions. [2019-12-07 11:56:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:30,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:56:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:30,839 INFO L225 Difference]: With dead ends: 2168 [2019-12-07 11:56:30,839 INFO L226 Difference]: Without dead ends: 2168 [2019-12-07 11:56:30,839 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 11:56:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-07 11:56:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-07 11:56:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-07 11:56:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 5337 transitions. [2019-12-07 11:56:30,865 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 5337 transitions. Word has length 18 [2019-12-07 11:56:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:30,865 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 5337 transitions. [2019-12-07 11:56:30,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 5337 transitions. [2019-12-07 11:56:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:56:30,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:30,868 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 11:56:30,868 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-07 11:56:30,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:30,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759455972] [2019-12-07 11:56:30,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:30,910 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 11:56:30,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759455972] [2019-12-07 11:56:30,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:30,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:30,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737171777] [2019-12-07 11:56:30,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:30,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:30,911 INFO L87 Difference]: Start difference. First operand 2168 states and 5337 transitions. Second operand 5 states. [2019-12-07 11:56:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:31,032 INFO L93 Difference]: Finished difference Result 2757 states and 6648 transitions. [2019-12-07 11:56:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:56:31,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:56:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:31,034 INFO L225 Difference]: With dead ends: 2757 [2019-12-07 11:56:31,034 INFO L226 Difference]: Without dead ends: 2721 [2019-12-07 11:56:31,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 11:56:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-07 11:56:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2253. [2019-12-07 11:56:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-07 11:56:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5518 transitions. [2019-12-07 11:56:31,055 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5518 transitions. Word has length 26 [2019-12-07 11:56:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,055 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 5518 transitions. [2019-12-07 11:56:31,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5518 transitions. [2019-12-07 11:56:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:56:31,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:31,058 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-12-07 11:56:31,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139765743] [2019-12-07 11:56:31,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,130 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 11:56:31,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139765743] [2019-12-07 11:56:31,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:31,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8809584] [2019-12-07 11:56:31,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:31,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:31,132 INFO L87 Difference]: Start difference. First operand 2253 states and 5518 transitions. Second operand 5 states. [2019-12-07 11:56:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:31,278 INFO L93 Difference]: Finished difference Result 2518 states and 6098 transitions. [2019-12-07 11:56:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:31,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:56:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:31,281 INFO L225 Difference]: With dead ends: 2518 [2019-12-07 11:56:31,281 INFO L226 Difference]: Without dead ends: 2518 [2019-12-07 11:56:31,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-12-07 11:56:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2314. [2019-12-07 11:56:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2019-12-07 11:56:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 5632 transitions. [2019-12-07 11:56:31,307 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 5632 transitions. Word has length 27 [2019-12-07 11:56:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,307 INFO L462 AbstractCegarLoop]: Abstraction has 2314 states and 5632 transitions. [2019-12-07 11:56:31,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 5632 transitions. [2019-12-07 11:56:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:56:31,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:31,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-12-07 11:56:31,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791461295] [2019-12-07 11:56:31,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,359 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 11:56:31,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791461295] [2019-12-07 11:56:31,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:31,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529051814] [2019-12-07 11:56:31,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:31,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:31,361 INFO L87 Difference]: Start difference. First operand 2314 states and 5632 transitions. Second operand 5 states. [2019-12-07 11:56:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:31,490 INFO L93 Difference]: Finished difference Result 2702 states and 6515 transitions. [2019-12-07 11:56:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:56:31,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:56:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:31,493 INFO L225 Difference]: With dead ends: 2702 [2019-12-07 11:56:31,493 INFO L226 Difference]: Without dead ends: 2666 [2019-12-07 11:56:31,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-07 11:56:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2254. [2019-12-07 11:56:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-12-07 11:56:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 5516 transitions. [2019-12-07 11:56:31,514 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 5516 transitions. Word has length 27 [2019-12-07 11:56:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,515 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 5516 transitions. [2019-12-07 11:56:31,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 5516 transitions. [2019-12-07 11:56:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:56:31,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:31,517 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash -784111204, now seen corresponding path program 1 times [2019-12-07 11:56:31,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820103419] [2019-12-07 11:56:31,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,569 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 11:56:31,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820103419] [2019-12-07 11:56:31,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:31,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900607684] [2019-12-07 11:56:31,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:31,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:31,571 INFO L87 Difference]: Start difference. First operand 2254 states and 5516 transitions. Second operand 5 states. [2019-12-07 11:56:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:31,812 INFO L93 Difference]: Finished difference Result 3432 states and 8219 transitions. [2019-12-07 11:56:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:31,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:56:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:31,815 INFO L225 Difference]: With dead ends: 3432 [2019-12-07 11:56:31,815 INFO L226 Difference]: Without dead ends: 3432 [2019-12-07 11:56:31,815 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 11:56:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-12-07 11:56:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3013. [2019-12-07 11:56:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3013 states. [2019-12-07 11:56:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 7254 transitions. [2019-12-07 11:56:31,842 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 7254 transitions. Word has length 27 [2019-12-07 11:56:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,842 INFO L462 AbstractCegarLoop]: Abstraction has 3013 states and 7254 transitions. [2019-12-07 11:56:31,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 7254 transitions. [2019-12-07 11:56:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:56:31,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:31,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-12-07 11:56:31,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183934545] [2019-12-07 11:56:31,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,874 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 11:56:31,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183934545] [2019-12-07 11:56:31,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:31,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843435820] [2019-12-07 11:56:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:31,875 INFO L87 Difference]: Start difference. First operand 3013 states and 7254 transitions. Second operand 4 states. [2019-12-07 11:56:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:31,888 INFO L93 Difference]: Finished difference Result 1587 states and 3608 transitions. [2019-12-07 11:56:31,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:31,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 11:56:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:31,890 INFO L225 Difference]: With dead ends: 1587 [2019-12-07 11:56:31,890 INFO L226 Difference]: Without dead ends: 1587 [2019-12-07 11:56:31,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-07 11:56:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 927. [2019-12-07 11:56:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-07 11:56:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2077 transitions. [2019-12-07 11:56:31,902 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2077 transitions. Word has length 28 [2019-12-07 11:56:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,902 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2077 transitions. [2019-12-07 11:56:31,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2077 transitions. [2019-12-07 11:56:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:56:31,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,904 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] [2019-12-07 11:56:31,904 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-07 11:56:31,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455215128] [2019-12-07 11:56:31,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,977 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 11:56:31,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455215128] [2019-12-07 11:56:31,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:56:31,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948792474] [2019-12-07 11:56:31,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:31,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:31,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:31,979 INFO L87 Difference]: Start difference. First operand 927 states and 2077 transitions. Second operand 6 states. [2019-12-07 11:56:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:32,305 INFO L93 Difference]: Finished difference Result 1160 states and 2544 transitions. [2019-12-07 11:56:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:56:32,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 11:56:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:32,306 INFO L225 Difference]: With dead ends: 1160 [2019-12-07 11:56:32,306 INFO L226 Difference]: Without dead ends: 1160 [2019-12-07 11:56:32,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:56:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-12-07 11:56:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 941. [2019-12-07 11:56:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-07 11:56:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2105 transitions. [2019-12-07 11:56:32,318 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2105 transitions. Word has length 41 [2019-12-07 11:56:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:32,318 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 2105 transitions. [2019-12-07 11:56:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2105 transitions. [2019-12-07 11:56:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:56:32,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:32,320 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] [2019-12-07 11:56:32,320 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash -231336031, now seen corresponding path program 2 times [2019-12-07 11:56:32,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:32,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266611732] [2019-12-07 11:56:32,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:32,362 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 11:56:32,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266611732] [2019-12-07 11:56:32,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:32,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:32,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862203536] [2019-12-07 11:56:32,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:32,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:32,364 INFO L87 Difference]: Start difference. First operand 941 states and 2105 transitions. Second operand 3 states. [2019-12-07 11:56:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:32,375 INFO L93 Difference]: Finished difference Result 939 states and 2100 transitions. [2019-12-07 11:56:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:32,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:56:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:32,376 INFO L225 Difference]: With dead ends: 939 [2019-12-07 11:56:32,376 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 11:56:32,377 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 11:56:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 11:56:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 840. [2019-12-07 11:56:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 11:56:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1901 transitions. [2019-12-07 11:56:32,388 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1901 transitions. Word has length 41 [2019-12-07 11:56:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:32,388 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1901 transitions. [2019-12-07 11:56:32,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1901 transitions. [2019-12-07 11:56:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:56:32,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:32,390 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 11:56:32,390 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-12-07 11:56:32,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:32,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738879072] [2019-12-07 11:56:32,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:32,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738879072] [2019-12-07 11:56:32,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:32,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:32,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10795631] [2019-12-07 11:56:32,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:32,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:32,448 INFO L87 Difference]: Start difference. First operand 840 states and 1901 transitions. Second operand 6 states. [2019-12-07 11:56:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:32,585 INFO L93 Difference]: Finished difference Result 1972 states and 4389 transitions. [2019-12-07 11:56:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:56:32,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 11:56:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:32,586 INFO L225 Difference]: With dead ends: 1972 [2019-12-07 11:56:32,586 INFO L226 Difference]: Without dead ends: 1331 [2019-12-07 11:56:32,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:56:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-12-07 11:56:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 906. [2019-12-07 11:56:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-12-07 11:56:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2050 transitions. [2019-12-07 11:56:32,595 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2050 transitions. Word has length 42 [2019-12-07 11:56:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:32,595 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 2050 transitions. [2019-12-07 11:56:32,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2050 transitions. [2019-12-07 11:56:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:56:32,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:32,596 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 11:56:32,597 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1626226089, now seen corresponding path program 2 times [2019-12-07 11:56:32,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:32,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66799760] [2019-12-07 11:56:32,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:32,650 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 11:56:32,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66799760] [2019-12-07 11:56:32,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:32,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:32,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688586924] [2019-12-07 11:56:32,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:32,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:32,651 INFO L87 Difference]: Start difference. First operand 906 states and 2050 transitions. Second operand 4 states. [2019-12-07 11:56:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:32,664 INFO L93 Difference]: Finished difference Result 1496 states and 3407 transitions. [2019-12-07 11:56:32,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:32,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 11:56:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:32,665 INFO L225 Difference]: With dead ends: 1496 [2019-12-07 11:56:32,665 INFO L226 Difference]: Without dead ends: 618 [2019-12-07 11:56:32,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-12-07 11:56:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-12-07 11:56:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-12-07 11:56:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1405 transitions. [2019-12-07 11:56:32,671 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1405 transitions. Word has length 42 [2019-12-07 11:56:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:32,671 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 1405 transitions. [2019-12-07 11:56:32,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1405 transitions. [2019-12-07 11:56:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:56:32,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:32,672 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 11:56:32,672 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 3 times [2019-12-07 11:56:32,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:32,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101326277] [2019-12-07 11:56:32,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:32,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:32,725 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:56:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35| 1)) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1637~0.offset_24|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1637~0.base_35|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35|) |v_ULTIMATE.start_main_~#t1637~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35|)) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1637~0.offset=|v_ULTIMATE.start_main_~#t1637~0.offset_24|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1637~0.base=|v_ULTIMATE.start_main_~#t1637~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_24|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_35|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1637~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1637~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1638~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1638~0.base, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:56:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| 4) |v_#length_9|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1638~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1638~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1638~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10|) |v_ULTIMATE.start_main_~#t1638~0.offset_9| 1))) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1638~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1638~0.offset] because there is no mapped edge [2019-12-07 11:56:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~y~0_Out1959533758 ~__unbuffered_p1_EBX~0_Out1959533758) (= ~x$r_buff0_thd2~0_Out1959533758 1) (= ~x$r_buff1_thd1~0_Out1959533758 ~x$r_buff0_thd1~0_In1959533758) (= ~y~0_Out1959533758 ~__unbuffered_p1_EAX~0_Out1959533758) (= ~x$r_buff1_thd2~0_Out1959533758 ~x$r_buff0_thd2~0_In1959533758) (= ~y~0_Out1959533758 1) (= ~x$r_buff1_thd0~0_Out1959533758 ~x$r_buff0_thd0~0_In1959533758) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758 0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1959533758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959533758, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1959533758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1959533758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959533758, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1959533758, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1959533758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1959533758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1959533758, ~y~0=~y~0_Out1959533758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1959533758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1959533758} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:56:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 11:56:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-433443804 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In-433443804 256))))) (and .cse0 (or (not (= 0 (mod ~x$w_buff1_used~0_In-433443804 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite22_Out-433443804| |P0Thread1of1ForFork1_#t~ite23_Out-433443804|) (or (not (= (mod ~x$r_buff1_thd1~0_In-433443804 256) 0)) .cse1) (not (= (mod ~x$w_buff0_used~0_In-433443804 256) 0)) (= |P0Thread1of1ForFork1_#t~ite22_Out-433443804| 0) (= |P0Thread1of1ForFork1_#t~ite23_Out-433443804| |P0Thread1of1ForFork1_#t~ite24_Out-433443804|))) (and (not .cse0) (= ~x$r_buff1_thd1~0_In-433443804 |P0Thread1of1ForFork1_#t~ite24_Out-433443804|) (= |P0Thread1of1ForFork1_#t~ite23_In-433443804| |P0Thread1of1ForFork1_#t~ite23_Out-433443804|) (= |P0Thread1of1ForFork1_#t~ite22_In-433443804| |P0Thread1of1ForFork1_#t~ite22_Out-433443804|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-433443804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-433443804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-433443804, ~weak$$choice2~0=~weak$$choice2~0_In-433443804, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-433443804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433443804, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-433443804|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-433443804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-433443804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-433443804, ~weak$$choice2~0=~weak$$choice2~0_In-433443804, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-433443804|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-433443804|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-433443804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433443804} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 11:56:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:56:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1463596904 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1463596904 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1463596904| ~x$w_buff0_used~0_In-1463596904) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1463596904| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1463596904, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1463596904} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1463596904, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1463596904|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1463596904} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:56:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1745544852 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1745544852 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1745544852 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1745544852 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1745544852 |P1Thread1of1ForFork0_#t~ite29_Out-1745544852|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1745544852| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1745544852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1745544852, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1745544852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1745544852} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1745544852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1745544852, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1745544852, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1745544852|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1745544852} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1020216162 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In1020216162 ~x$r_buff0_thd2~0_Out1020216162)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1020216162 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1020216162) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1020216162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020216162} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1020216162|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1020216162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020216162} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1247859813 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1247859813 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1247859813 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1247859813 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In1247859813 |P1Thread1of1ForFork0_#t~ite31_Out1247859813|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1247859813|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1247859813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1247859813, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1247859813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247859813} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1247859813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1247859813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1247859813, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1247859813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247859813} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1855820490 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1855820490 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-1855820490| ~x$w_buff1~0_In-1855820490) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1855820490 |ULTIMATE.start_main_#t~ite34_Out-1855820490|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1855820490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855820490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1855820490, ~x~0=~x~0_In-1855820490} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1855820490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855820490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1855820490, ~x~0=~x~0_In-1855820490, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1855820490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:56:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-131100707 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-131100707 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-131100707|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-131100707| ~x$w_buff0_used~0_In-131100707) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-131100707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131100707} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-131100707, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-131100707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131100707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 11:56:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1850383091 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1850383091 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1850383091 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1850383091 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1850383091 |ULTIMATE.start_main_#t~ite37_Out1850383091|)) (and (= |ULTIMATE.start_main_#t~ite37_Out1850383091| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850383091, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850383091, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850383091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850383091} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850383091, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850383091, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1850383091|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850383091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850383091} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:56:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-654725318 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-654725318 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-654725318|)) (and (= ~x$r_buff0_thd0~0_In-654725318 |ULTIMATE.start_main_#t~ite38_Out-654725318|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-654725318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654725318} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-654725318, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-654725318|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654725318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:56:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1192125051 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1192125051 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1192125051 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1192125051 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1192125051| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1192125051| ~x$r_buff1_thd0~0_In1192125051) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192125051, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192125051, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192125051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192125051} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192125051, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1192125051|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192125051, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192125051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192125051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:56:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:56:32,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:56:32 BasicIcfg [2019-12-07 11:56:32,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:56:32,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:56:32,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:56:32,772 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:56:32,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:24" (3/4) ... [2019-12-07 11:56:32,774 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:56:32,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35| 1)) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1637~0.offset_24|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1637~0.base_35|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1637~0.base_35|) |v_ULTIMATE.start_main_~#t1637~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1637~0.base_35|)) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1637~0.offset=|v_ULTIMATE.start_main_~#t1637~0.offset_24|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1637~0.base=|v_ULTIMATE.start_main_~#t1637~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_24|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_35|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1637~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1637~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1638~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1638~0.base, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:56:32,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| 4) |v_#length_9|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1638~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1638~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1638~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1638~0.base_10|) |v_ULTIMATE.start_main_~#t1638~0.offset_9| 1))) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1638~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1638~0.base=|v_ULTIMATE.start_main_~#t1638~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1638~0.offset=|v_ULTIMATE.start_main_~#t1638~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1638~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1638~0.offset] because there is no mapped edge [2019-12-07 11:56:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~y~0_Out1959533758 ~__unbuffered_p1_EBX~0_Out1959533758) (= ~x$r_buff0_thd2~0_Out1959533758 1) (= ~x$r_buff1_thd1~0_Out1959533758 ~x$r_buff0_thd1~0_In1959533758) (= ~y~0_Out1959533758 ~__unbuffered_p1_EAX~0_Out1959533758) (= ~x$r_buff1_thd2~0_Out1959533758 ~x$r_buff0_thd2~0_In1959533758) (= ~y~0_Out1959533758 1) (= ~x$r_buff1_thd0~0_Out1959533758 ~x$r_buff0_thd0~0_In1959533758) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758 0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1959533758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959533758, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1959533758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1959533758, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1959533758, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1959533758, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1959533758, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1959533758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1959533758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1959533758, ~y~0=~y~0_Out1959533758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1959533758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1959533758} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:56:32,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 11:56:32,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-433443804 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In-433443804 256))))) (and .cse0 (or (not (= 0 (mod ~x$w_buff1_used~0_In-433443804 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite22_Out-433443804| |P0Thread1of1ForFork1_#t~ite23_Out-433443804|) (or (not (= (mod ~x$r_buff1_thd1~0_In-433443804 256) 0)) .cse1) (not (= (mod ~x$w_buff0_used~0_In-433443804 256) 0)) (= |P0Thread1of1ForFork1_#t~ite22_Out-433443804| 0) (= |P0Thread1of1ForFork1_#t~ite23_Out-433443804| |P0Thread1of1ForFork1_#t~ite24_Out-433443804|))) (and (not .cse0) (= ~x$r_buff1_thd1~0_In-433443804 |P0Thread1of1ForFork1_#t~ite24_Out-433443804|) (= |P0Thread1of1ForFork1_#t~ite23_In-433443804| |P0Thread1of1ForFork1_#t~ite23_Out-433443804|) (= |P0Thread1of1ForFork1_#t~ite22_In-433443804| |P0Thread1of1ForFork1_#t~ite22_Out-433443804|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-433443804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-433443804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-433443804, ~weak$$choice2~0=~weak$$choice2~0_In-433443804, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-433443804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433443804, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-433443804|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-433443804, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-433443804, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-433443804, ~weak$$choice2~0=~weak$$choice2~0_In-433443804, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-433443804|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-433443804|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-433443804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433443804} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 11:56:32,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1463596904 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1463596904 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1463596904| ~x$w_buff0_used~0_In-1463596904) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1463596904| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1463596904, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1463596904} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1463596904, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1463596904|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1463596904} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1745544852 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1745544852 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1745544852 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1745544852 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1745544852 |P1Thread1of1ForFork0_#t~ite29_Out-1745544852|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1745544852| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1745544852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1745544852, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1745544852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1745544852} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1745544852, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1745544852, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1745544852, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1745544852|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1745544852} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1020216162 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In1020216162 ~x$r_buff0_thd2~0_Out1020216162)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1020216162 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1020216162) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1020216162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020216162} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1020216162|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1020216162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1020216162} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1247859813 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1247859813 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1247859813 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1247859813 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In1247859813 |P1Thread1of1ForFork0_#t~ite31_Out1247859813|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1247859813|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1247859813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1247859813, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1247859813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247859813} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1247859813|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1247859813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1247859813, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1247859813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247859813} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:56:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1855820490 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1855820490 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-1855820490| ~x$w_buff1~0_In-1855820490) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1855820490 |ULTIMATE.start_main_#t~ite34_Out-1855820490|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1855820490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855820490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1855820490, ~x~0=~x~0_In-1855820490} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1855820490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1855820490, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1855820490, ~x~0=~x~0_In-1855820490, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1855820490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:56:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 11:56:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-131100707 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-131100707 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-131100707|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-131100707| ~x$w_buff0_used~0_In-131100707) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-131100707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131100707} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-131100707, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-131100707|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-131100707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 11:56:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1850383091 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1850383091 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1850383091 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1850383091 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1850383091 |ULTIMATE.start_main_#t~ite37_Out1850383091|)) (and (= |ULTIMATE.start_main_#t~ite37_Out1850383091| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850383091, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850383091, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850383091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850383091} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1850383091, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1850383091, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1850383091|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1850383091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1850383091} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:56:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-654725318 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-654725318 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-654725318|)) (and (= ~x$r_buff0_thd0~0_In-654725318 |ULTIMATE.start_main_#t~ite38_Out-654725318|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-654725318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654725318} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-654725318, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-654725318|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654725318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:56:32,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1192125051 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1192125051 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1192125051 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1192125051 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1192125051| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1192125051| ~x$r_buff1_thd0~0_In1192125051) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192125051, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192125051, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192125051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192125051} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1192125051, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1192125051|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1192125051, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1192125051, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1192125051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:56:32,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:56:32,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3d24c9ee-5d92-445c-a0e7-432b7dffb86c/bin/uautomizer/witness.graphml [2019-12-07 11:56:32,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:56:32,830 INFO L168 Benchmark]: Toolchain (without parser) took 8917.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 937.2 MB in the beginning and 1.2 GB in the end (delta: -248.7 MB). Peak memory consumption was 191.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,830 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:32,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.21 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,831 INFO L168 Benchmark]: Boogie Preprocessor took 30.77 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,831 INFO L168 Benchmark]: RCFGBuilder took 356.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,832 INFO L168 Benchmark]: TraceAbstraction took 8046.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.9 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,832 INFO L168 Benchmark]: Witness Printer took 57.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:32,834 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.21 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.77 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 356.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8046.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.9 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. * Witness Printer took 57.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1637, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] FCALL, FORK 0 pthread_create(&t1638, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L777] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1891 SDtfs, 1485 SDslu, 2918 SDs, 0 SdLazy, 1715 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 9382 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 50027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...