./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.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_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/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 bd96c0671cce65dbf63867d7bfdc53d4e1ac2a39 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:53:00,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:53:00,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:53:00,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:53:00,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:53:00,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:53:00,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:53:00,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:53:00,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:53:00,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:53:00,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:53:00,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:53:00,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:53:00,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:53:00,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:53:00,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:53:00,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:53:00,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:53:00,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:53:00,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:53:00,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:53:00,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:53:00,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:53:00,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:53:00,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:53:00,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:53:00,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:53:00,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:53:00,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:53:00,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:53:00,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:53:00,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:53:00,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:53:00,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:53:00,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:53:00,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:53:00,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:53:00,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:53:00,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:53:00,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:53:00,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:53:00,301 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:53:00,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:53:00,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:53:00,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:53:00,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:53:00,314 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:53:00,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:53:00,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:53:00,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:53:00,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:53:00,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:53:00,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:53:00,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:53:00,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:53:00,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/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 -> bd96c0671cce65dbf63867d7bfdc53d4e1ac2a39 [2019-12-07 12:53:00,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:53:00,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:53:00,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:53:00,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:53:00,437 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:53:00,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2019-12-07 12:53:00,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/data/31b51f7e4/7878a6a51a3742749b7ef56c57aafefc/FLAG1446fba73 [2019-12-07 12:53:00,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:53:00,947 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2019-12-07 12:53:00,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/data/31b51f7e4/7878a6a51a3742749b7ef56c57aafefc/FLAG1446fba73 [2019-12-07 12:53:00,965 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/data/31b51f7e4/7878a6a51a3742749b7ef56c57aafefc [2019-12-07 12:53:00,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:53:00,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:53:00,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:53:00,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:53:00,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:53:00,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:53:00" (1/1) ... [2019-12-07 12:53:00,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a76675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:00, skipping insertion in model container [2019-12-07 12:53:00,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:53:00" (1/1) ... [2019-12-07 12:53:00,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:53:01,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:53:01,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:53:01,242 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:53:01,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:53:01,314 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:53:01,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01 WrapperNode [2019-12-07 12:53:01,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:53:01,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:53:01,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:53:01,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:53:01,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:53:01,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:53:01,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:53:01,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:53:01,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... [2019-12-07 12:53:01,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:53:01,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:53:01,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:53:01,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:53:01,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/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 12:53:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:53:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:53:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2019-12-07 12:53:01,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2019-12-07 12:53:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:53:01,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:53:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:53:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:53:01,416 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2019-12-07 12:53:01,416 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2019-12-07 12:53:01,417 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 12:53:01,518 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_take_read_lock_returnLabel [2019-12-07 12:53:01,618 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_take_write_lock_returnLabel [2019-12-07 12:53:01,624 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:53:01,624 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:53:01,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:01 BoogieIcfgContainer [2019-12-07 12:53:01,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:53:01,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:53:01,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:53:01,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:53:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:53:00" (1/3) ... [2019-12-07 12:53:01,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486aabee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:53:01, skipping insertion in model container [2019-12-07 12:53:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:01" (2/3) ... [2019-12-07 12:53:01,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486aabee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:53:01, skipping insertion in model container [2019-12-07 12:53:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:01" (3/3) ... [2019-12-07 12:53:01,629 INFO L109 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2019-12-07 12:53:01,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:53:01,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:53:01,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:53:01,641 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:53:01,660 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,660 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,660 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,661 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,661 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,661 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,661 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,661 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,662 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,663 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,664 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,665 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:53:01,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:53:01,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:53:01,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:53:01,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:53:01,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:53:01,715 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:53:01,715 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:53:01,715 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:53:01,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:53:01,725 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 98 transitions [2019-12-07 12:53:01,727 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions [2019-12-07 12:53:01,778 INFO L134 PetriNetUnfolder]: 19/132 cut-off events. [2019-12-07 12:53:01,778 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:53:01,784 INFO L76 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 132 events. 19/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 446 event pairs. 87/215 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2019-12-07 12:53:01,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions [2019-12-07 12:53:01,819 INFO L134 PetriNetUnfolder]: 19/132 cut-off events. [2019-12-07 12:53:01,819 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:53:01,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 132 events. 19/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 446 event pairs. 87/215 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2019-12-07 12:53:01,825 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2238 [2019-12-07 12:53:01,826 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:53:02,714 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-12-07 12:53:02,790 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7152 [2019-12-07 12:53:02,790 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-07 12:53:02,793 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 57 transitions [2019-12-07 12:53:03,084 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5381 states. [2019-12-07 12:53:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states. [2019-12-07 12:53:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:53:03,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:03,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:03,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1104717079, now seen corresponding path program 1 times [2019-12-07 12:53:03,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:03,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296352178] [2019-12-07 12:53:03,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:53:03,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296352178] [2019-12-07 12:53:03,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:03,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:03,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823089664] [2019-12-07 12:53:03,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:03,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:03,248 INFO L87 Difference]: Start difference. First operand 5381 states. Second operand 4 states. [2019-12-07 12:53:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:03,429 INFO L93 Difference]: Finished difference Result 10812 states and 36249 transitions. [2019-12-07 12:53:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:53:03,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:53:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:03,492 INFO L225 Difference]: With dead ends: 10812 [2019-12-07 12:53:03,492 INFO L226 Difference]: Without dead ends: 7730 [2019-12-07 12:53:03,493 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 12:53:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2019-12-07 12:53:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 5052. [2019-12-07 12:53:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5052 states. [2019-12-07 12:53:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 17159 transitions. [2019-12-07 12:53:03,716 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 17159 transitions. Word has length 8 [2019-12-07 12:53:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:03,716 INFO L462 AbstractCegarLoop]: Abstraction has 5052 states and 17159 transitions. [2019-12-07 12:53:03,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 17159 transitions. [2019-12-07 12:53:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:53:03,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:03,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:03,718 INFO L410 AbstractCegarLoop]: === Iteration 2 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1286591340, now seen corresponding path program 1 times [2019-12-07 12:53:03,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:03,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205428872] [2019-12-07 12:53:03,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:03,784 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 12:53:03,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205428872] [2019-12-07 12:53:03,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:03,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:03,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146083868] [2019-12-07 12:53:03,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:03,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:03,786 INFO L87 Difference]: Start difference. First operand 5052 states and 17159 transitions. Second operand 3 states. [2019-12-07 12:53:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:03,844 INFO L93 Difference]: Finished difference Result 4317 states and 12958 transitions. [2019-12-07 12:53:03,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:03,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 12:53:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:03,873 INFO L225 Difference]: With dead ends: 4317 [2019-12-07 12:53:03,873 INFO L226 Difference]: Without dead ends: 4275 [2019-12-07 12:53:03,873 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 12:53:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-07 12:53:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2019-12-07 12:53:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-07 12:53:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 12848 transitions. [2019-12-07 12:53:03,966 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 12848 transitions. Word has length 10 [2019-12-07 12:53:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:03,966 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 12848 transitions. [2019-12-07 12:53:03,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 12848 transitions. [2019-12-07 12:53:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:53:03,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:03,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:03,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash -755937034, now seen corresponding path program 2 times [2019-12-07 12:53:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:03,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110231309] [2019-12-07 12:53:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:04,005 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 12:53:04,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110231309] [2019-12-07 12:53:04,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:04,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:04,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555269264] [2019-12-07 12:53:04,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:04,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:04,007 INFO L87 Difference]: Start difference. First operand 4275 states and 12848 transitions. Second operand 4 states. [2019-12-07 12:53:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:04,047 INFO L93 Difference]: Finished difference Result 2906 states and 7004 transitions. [2019-12-07 12:53:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:04,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 12:53:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:04,063 INFO L225 Difference]: With dead ends: 2906 [2019-12-07 12:53:04,063 INFO L226 Difference]: Without dead ends: 2798 [2019-12-07 12:53:04,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-12-07 12:53:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2390. [2019-12-07 12:53:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-12-07 12:53:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 5909 transitions. [2019-12-07 12:53:04,110 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 5909 transitions. Word has length 10 [2019-12-07 12:53:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:04,111 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 5909 transitions. [2019-12-07 12:53:04,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 5909 transitions. [2019-12-07 12:53:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:53:04,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:04,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:04,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 823084110, now seen corresponding path program 1 times [2019-12-07 12:53:04,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:04,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511828598] [2019-12-07 12:53:04,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:53:04,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511828598] [2019-12-07 12:53:04,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:04,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:04,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108173204] [2019-12-07 12:53:04,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:04,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:04,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:04,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:04,142 INFO L87 Difference]: Start difference. First operand 2390 states and 5909 transitions. Second operand 4 states. [2019-12-07 12:53:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:04,189 INFO L93 Difference]: Finished difference Result 2639 states and 6454 transitions. [2019-12-07 12:53:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:53:04,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:53:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:04,197 INFO L225 Difference]: With dead ends: 2639 [2019-12-07 12:53:04,198 INFO L226 Difference]: Without dead ends: 1900 [2019-12-07 12:53:04,198 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 12:53:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-12-07 12:53:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1546. [2019-12-07 12:53:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-12-07 12:53:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 3824 transitions. [2019-12-07 12:53:04,227 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 3824 transitions. Word has length 12 [2019-12-07 12:53:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:04,228 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 3824 transitions. [2019-12-07 12:53:04,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 3824 transitions. [2019-12-07 12:53:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:53:04,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:04,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:04,230 INFO L410 AbstractCegarLoop]: === Iteration 5 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -89098316, now seen corresponding path program 1 times [2019-12-07 12:53:04,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:04,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133482262] [2019-12-07 12:53:04,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:04,275 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 12:53:04,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133482262] [2019-12-07 12:53:04,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:04,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:53:04,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564755112] [2019-12-07 12:53:04,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:53:04,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:04,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:53:04,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:53:04,276 INFO L87 Difference]: Start difference. First operand 1546 states and 3824 transitions. Second operand 6 states. [2019-12-07 12:53:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:04,330 INFO L93 Difference]: Finished difference Result 1759 states and 4308 transitions. [2019-12-07 12:53:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:53:04,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 12:53:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:04,339 INFO L225 Difference]: With dead ends: 1759 [2019-12-07 12:53:04,339 INFO L226 Difference]: Without dead ends: 1641 [2019-12-07 12:53:04,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:53:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-07 12:53:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1509. [2019-12-07 12:53:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-07 12:53:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3739 transitions. [2019-12-07 12:53:04,366 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3739 transitions. Word has length 20 [2019-12-07 12:53:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:04,366 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 3739 transitions. [2019-12-07 12:53:04,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:53:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3739 transitions. [2019-12-07 12:53:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:53:04,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:04,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:04,368 INFO L410 AbstractCegarLoop]: === Iteration 6 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-07 12:53:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1516834824, now seen corresponding path program 2 times [2019-12-07 12:53:04,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:04,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112022972] [2019-12-07 12:53:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:53:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:53:04,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:53:04,425 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:53:04,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [237] [237] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse1 (store |v_#valid_61| 0 0))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t1~0.base_21| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0.base_21| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t3~0.base_20| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t4~0.base_21| 1) |v_#valid_59|) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t1~0.base_21|)) (= |v_ULTIMATE.start_main_~#t4~0.offset_17| 0) (= |v_ULTIMATE.start_main_~#t3~0.offset_17| 0) (= 0 v_~r~0_144) (= 0 v_~w~0_140) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t3~0.base_20|) (= |v_ULTIMATE.start_main_~#t2~0.offset_17| 0) (= (store (store (store (store |v_#length_25| |v_ULTIMATE.start_main_~#t1~0.base_21| 4) |v_ULTIMATE.start_main_~#t2~0.base_21| 4) |v_ULTIMATE.start_main_~#t3~0.base_20| 4) |v_ULTIMATE.start_main_~#t4~0.base_21| 4) |v_#length_23|) (= (store |v_#memory_int_25| |v_ULTIMATE.start_main_~#t1~0.base_21| (store (select |v_#memory_int_25| |v_ULTIMATE.start_main_~#t1~0.base_21|) |v_ULTIMATE.start_main_~#t1~0.offset_17| 0)) |v_#memory_int_24|) (= v_~x~0_58 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0.base_21|) 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#t3~0.base_20|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2~0.base_21|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1~0.base_21|) (= v_~y~0_60 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t1~0.offset_17| 0) (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t4~0.base_21|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t4~0.base_21|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_25|, #length=|v_#length_25|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_7|, ~w~0=v_~w~0_140, #length=|v_#length_23|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_17|, ~y~0=v_~y~0_60, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_21|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_15|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_17|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_20|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_21|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_21|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_15|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_15|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_17|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_17|, ~x~0=v_~x~0_58, ~r~0=v_~r~0_144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ~w~0, #length, ULTIMATE.start_main_~#t3~0.offset, ~y~0, ULTIMATE.start_main_~#t2~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_~#t2~0.offset, ULTIMATE.start_main_~#t3~0.base, #NULL.base, ULTIMATE.start_main_~#t4~0.base, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_~#t4~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [212] [212] L701-1-->L702-1: Formula: (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_11|) |v_ULTIMATE.start_main_~#t2~0.offset_10| 1)) |v_#memory_int_17|) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_10|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_11|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_10|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [215] [215] L702-2-->L703-1: Formula: (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_10| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_10|) |v_ULTIMATE.start_main_~#t3~0.offset_10| 2)) |v_#memory_int_19|) InVars {#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_10|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_10|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_10|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [218] [218] readerENTRY-->L692: Formula: (and (not (= 0 (ite (= v_~w~0_44 0) 1 0))) (= |v_readerThread1of1ForFork1_#in~arg.base_4| v_readerThread1of1ForFork1_~arg.base_2) (= |v_readerThread1of1ForFork1_#in~arg.offset_4| v_readerThread1of1ForFork1_~arg.offset_2) (= v_~r~0_50 (+ v_~r~0_51 1))) InVars {~w~0=v_~w~0_44, readerThread1of1ForFork1_#in~arg.offset=|v_readerThread1of1ForFork1_#in~arg.offset_4|, readerThread1of1ForFork1_#in~arg.base=|v_readerThread1of1ForFork1_#in~arg.base_4|, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_44, readerThread1of1ForFork1_#in~arg.offset=|v_readerThread1of1ForFork1_#in~arg.offset_4|, readerThread1of1ForFork1_~arg.offset=v_readerThread1of1ForFork1_~arg.offset_2, readerThread1of1ForFork1_#in~arg.base=|v_readerThread1of1ForFork1_#in~arg.base_4|, readerThread1of1ForFork1_~arg.base=v_readerThread1of1ForFork1_~arg.base_2, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_34, ~r~0=v_~r~0_50} AuxVars[] AssignedVars[readerThread1of1ForFork1_~arg.offset, readerThread1of1ForFork1_~arg.base, readerThread1of1ForFork1_~l~0, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [219] [219] L694-->L694-3: Formula: (= ~x~0_In-1757283874 ~y~0_In-1757283874) InVars {~y~0=~y~0_In-1757283874, ~x~0=~x~0_In-1757283874} OutVars{~y~0=~y~0_In-1757283874, ~x~0=~x~0_In-1757283874} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:53:04,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [206] [206] L703-2-->L704-1: Formula: (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t4~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t4~0.base_9|) |v_ULTIMATE.start_main_~#t4~0.offset_8| 3)) |v_#memory_int_15|) InVars {ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_9|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_8|, #memory_int=|v_#memory_int_16|} OutVars{ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_9|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_8|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|, #memory_int=|v_#memory_int_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [208] [208] readerENTRY-->L692: Formula: (and (= v_~r~0_17 (+ v_~r~0_18 1)) (not (= 0 (ite (= v_~w~0_18 0) 1 0))) (= v_readerThread1of1ForFork3_~arg.base_2 |v_readerThread1of1ForFork3_#in~arg.base_4|) (= v_readerThread1of1ForFork3_~arg.offset_2 |v_readerThread1of1ForFork3_#in~arg.offset_4|)) InVars {~w~0=v_~w~0_18, readerThread1of1ForFork3_#in~arg.base=|v_readerThread1of1ForFork3_#in~arg.base_4|, readerThread1of1ForFork3_#in~arg.offset=|v_readerThread1of1ForFork3_#in~arg.offset_4|, ~r~0=v_~r~0_18} OutVars{readerThread1of1ForFork3_~l~0=v_readerThread1of1ForFork3_~l~0_14, ~w~0=v_~w~0_18, readerThread1of1ForFork3_~arg.offset=v_readerThread1of1ForFork3_~arg.offset_2, readerThread1of1ForFork3_~arg.base=v_readerThread1of1ForFork3_~arg.base_2, readerThread1of1ForFork3_#in~arg.base=|v_readerThread1of1ForFork3_#in~arg.base_4|, readerThread1of1ForFork3_#in~arg.offset=|v_readerThread1of1ForFork3_#in~arg.offset_4|, ~r~0=v_~r~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0, readerThread1of1ForFork3_~arg.offset, readerThread1of1ForFork3_~arg.base, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [226] [226] L696-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res.offset_3| 0) (= v_readerThread1of1ForFork1_~l~0_55 v_~r~0_75) (= |v_readerThread1of1ForFork1_#res.base_3| 0)) InVars {readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_55} OutVars{readerThread1of1ForFork1_#res.base=|v_readerThread1of1ForFork1_#res.base_3|, readerThread1of1ForFork1_#res.offset=|v_readerThread1of1ForFork1_#res.offset_3|, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_55, ~r~0=v_~r~0_75} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res.base, readerThread1of1ForFork1_#res.offset, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [200] [200] L694-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_~x~0_10 v_~y~0_10)) InVars {~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:53:04,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:53:04 BasicIcfg [2019-12-07 12:53:04,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:53:04,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:53:04,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:53:04,453 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:53:04,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:01" (3/4) ... [2019-12-07 12:53:04,455 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:53:04,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [237] [237] ULTIMATE.startENTRY-->L701: Formula: (let ((.cse1 (store |v_#valid_61| 0 0))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t1~0.base_21| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0.base_21| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t3~0.base_20| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t4~0.base_21| 1) |v_#valid_59|) (= 0 (select .cse1 |v_ULTIMATE.start_main_~#t1~0.base_21|)) (= |v_ULTIMATE.start_main_~#t4~0.offset_17| 0) (= |v_ULTIMATE.start_main_~#t3~0.offset_17| 0) (= 0 v_~r~0_144) (= 0 v_~w~0_140) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t3~0.base_20|) (= |v_ULTIMATE.start_main_~#t2~0.offset_17| 0) (= (store (store (store (store |v_#length_25| |v_ULTIMATE.start_main_~#t1~0.base_21| 4) |v_ULTIMATE.start_main_~#t2~0.base_21| 4) |v_ULTIMATE.start_main_~#t3~0.base_20| 4) |v_ULTIMATE.start_main_~#t4~0.base_21| 4) |v_#length_23|) (= (store |v_#memory_int_25| |v_ULTIMATE.start_main_~#t1~0.base_21| (store (select |v_#memory_int_25| |v_ULTIMATE.start_main_~#t1~0.base_21|) |v_ULTIMATE.start_main_~#t1~0.offset_17| 0)) |v_#memory_int_24|) (= v_~x~0_58 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0.base_21|) 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse3 |v_ULTIMATE.start_main_~#t3~0.base_20|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2~0.base_21|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1~0.base_21|) (= v_~y~0_60 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_ULTIMATE.start_main_~#t1~0.offset_17| 0) (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t4~0.base_21|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t4~0.base_21|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_25|, #length=|v_#length_25|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_7|, ~w~0=v_~w~0_140, #length=|v_#length_23|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_17|, ~y~0=v_~y~0_60, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_21|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_15|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_17|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_20|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_21|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_21|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_15|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_15|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_17|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_17|, ~x~0=v_~x~0_58, ~r~0=v_~r~0_144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ~w~0, #length, ULTIMATE.start_main_~#t3~0.offset, ~y~0, ULTIMATE.start_main_~#t2~0.base, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_~#t2~0.offset, ULTIMATE.start_main_~#t3~0.base, #NULL.base, ULTIMATE.start_main_~#t4~0.base, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_~#t4~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [212] [212] L701-1-->L702-1: Formula: (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_11|) |v_ULTIMATE.start_main_~#t2~0.offset_10| 1)) |v_#memory_int_17|) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_10|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_11|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_10|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [215] [215] L702-2-->L703-1: Formula: (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_10| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_10|) |v_ULTIMATE.start_main_~#t3~0.offset_10| 2)) |v_#memory_int_19|) InVars {#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_10|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_10|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_10|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [218] [218] readerENTRY-->L692: Formula: (and (not (= 0 (ite (= v_~w~0_44 0) 1 0))) (= |v_readerThread1of1ForFork1_#in~arg.base_4| v_readerThread1of1ForFork1_~arg.base_2) (= |v_readerThread1of1ForFork1_#in~arg.offset_4| v_readerThread1of1ForFork1_~arg.offset_2) (= v_~r~0_50 (+ v_~r~0_51 1))) InVars {~w~0=v_~w~0_44, readerThread1of1ForFork1_#in~arg.offset=|v_readerThread1of1ForFork1_#in~arg.offset_4|, readerThread1of1ForFork1_#in~arg.base=|v_readerThread1of1ForFork1_#in~arg.base_4|, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_44, readerThread1of1ForFork1_#in~arg.offset=|v_readerThread1of1ForFork1_#in~arg.offset_4|, readerThread1of1ForFork1_~arg.offset=v_readerThread1of1ForFork1_~arg.offset_2, readerThread1of1ForFork1_#in~arg.base=|v_readerThread1of1ForFork1_#in~arg.base_4|, readerThread1of1ForFork1_~arg.base=v_readerThread1of1ForFork1_~arg.base_2, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_34, ~r~0=v_~r~0_50} AuxVars[] AssignedVars[readerThread1of1ForFork1_~arg.offset, readerThread1of1ForFork1_~arg.base, readerThread1of1ForFork1_~l~0, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [219] [219] L694-->L694-3: Formula: (= ~x~0_In-1757283874 ~y~0_In-1757283874) InVars {~y~0=~y~0_In-1757283874, ~x~0=~x~0_In-1757283874} OutVars{~y~0=~y~0_In-1757283874, ~x~0=~x~0_In-1757283874} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:53:04,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [206] [206] L703-2-->L704-1: Formula: (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t4~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t4~0.base_9|) |v_ULTIMATE.start_main_~#t4~0.offset_8| 3)) |v_#memory_int_15|) InVars {ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_9|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_8|, #memory_int=|v_#memory_int_16|} OutVars{ULTIMATE.start_main_~#t4~0.base=|v_ULTIMATE.start_main_~#t4~0.base_9|, ULTIMATE.start_main_~#t4~0.offset=|v_ULTIMATE.start_main_~#t4~0.offset_8|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|, #memory_int=|v_#memory_int_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] because there is no mapped edge [2019-12-07 12:53:04,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [208] [208] readerENTRY-->L692: Formula: (and (= v_~r~0_17 (+ v_~r~0_18 1)) (not (= 0 (ite (= v_~w~0_18 0) 1 0))) (= v_readerThread1of1ForFork3_~arg.base_2 |v_readerThread1of1ForFork3_#in~arg.base_4|) (= v_readerThread1of1ForFork3_~arg.offset_2 |v_readerThread1of1ForFork3_#in~arg.offset_4|)) InVars {~w~0=v_~w~0_18, readerThread1of1ForFork3_#in~arg.base=|v_readerThread1of1ForFork3_#in~arg.base_4|, readerThread1of1ForFork3_#in~arg.offset=|v_readerThread1of1ForFork3_#in~arg.offset_4|, ~r~0=v_~r~0_18} OutVars{readerThread1of1ForFork3_~l~0=v_readerThread1of1ForFork3_~l~0_14, ~w~0=v_~w~0_18, readerThread1of1ForFork3_~arg.offset=v_readerThread1of1ForFork3_~arg.offset_2, readerThread1of1ForFork3_~arg.base=v_readerThread1of1ForFork3_~arg.base_2, readerThread1of1ForFork3_#in~arg.base=|v_readerThread1of1ForFork3_#in~arg.base_4|, readerThread1of1ForFork3_#in~arg.offset=|v_readerThread1of1ForFork3_#in~arg.offset_4|, ~r~0=v_~r~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0, readerThread1of1ForFork3_~arg.offset, readerThread1of1ForFork3_~arg.base, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [226] [226] L696-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res.offset_3| 0) (= v_readerThread1of1ForFork1_~l~0_55 v_~r~0_75) (= |v_readerThread1of1ForFork1_#res.base_3| 0)) InVars {readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_55} OutVars{readerThread1of1ForFork1_#res.base=|v_readerThread1of1ForFork1_#res.base_3|, readerThread1of1ForFork1_#res.offset=|v_readerThread1of1ForFork1_#res.offset_3|, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_55, ~r~0=v_~r~0_75} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res.base, readerThread1of1ForFork1_#res.offset, ~r~0] because there is no mapped edge [2019-12-07 12:53:04,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [200] [200] L694-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_~x~0_10 v_~y~0_10)) InVars {~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:53:04,497 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_791c4460-2ef3-4988-a656-c07b3a099698/bin/uautomizer/witness.graphml [2019-12-07 12:53:04,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:53:04,499 INFO L168 Benchmark]: Toolchain (without parser) took 3530.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 938.2 MB in the beginning and 930.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,499 INFO L168 Benchmark]: CDTParser took 0.16 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 12:53:04,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.53 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,501 INFO L168 Benchmark]: Boogie Preprocessor took 16.74 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,501 INFO L168 Benchmark]: RCFGBuilder took 261.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,502 INFO L168 Benchmark]: TraceAbstraction took 2826.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 937.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,502 INFO L168 Benchmark]: Witness Printer took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 937.1 MB in the beginning and 930.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:53:04,505 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.53 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.74 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 261.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2826.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 937.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. * Witness Printer took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 937.1 MB in the beginning and 930.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.0s, 97 ProgramPointsBefore, 57 ProgramPointsAfterwards, 98 TransitionsBefore, 57 TransitionsAfterwards, 2238 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 813 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 7152 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 694]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L701] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, w=0, x=0, y=0] [L702] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, w=0, x=0, y=0] [L703] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, w=0, x=0, y=0] [L692] 2 l = x VAL [r=1, w=0, x=0, y=0] [L693] 2 y = l VAL [r=1, w=0, x=0, y=0] [L695] 2 l = r-1 VAL [r=1, w=0, x=0, y=0] [L704] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, w=0, x=0, y=0] [L684] CALL 1 __VERIFIER_atomic_take_write_lock() [L677] 1 w = 1 [L684] RET 1 __VERIFIER_atomic_take_write_lock() [L692] 4 l = x VAL [r=0, w=1, x=0, y=0] [L685] 1 x = 3 VAL [r=0, w=1, x=3, y=0] [L693] 4 y = l VAL [r=0, w=1, x=3, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 67 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 412 SDtfs, 418 SDslu, 513 SDs, 0 SdLazy, 147 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5381occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 3572 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...