/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:43:57,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:43:57,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:43:57,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:43:57,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:43:57,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:43:57,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:43:57,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:43:57,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:43:57,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:43:57,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:43:57,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:43:57,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:43:57,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:43:57,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:43:57,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:43:57,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:43:57,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:43:57,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:43:57,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:43:57,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:43:57,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:43:57,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:43:57,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:43:57,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:43:57,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:43:57,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:43:57,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:43:57,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:43:57,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:43:57,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:43:57,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:43:57,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:43:57,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:43:57,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:43:57,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:43:57,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:43:57,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:43:57,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:43:57,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:43:57,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:43:57,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 15:43:57,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:43:57,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:43:57,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:43:57,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:43:57,369 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:43:57,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:43:57,369 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:43:57,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:43:57,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:43:57,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:43:57,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:43:57,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:43:57,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:43:57,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:43:57,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:43:57,372 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:43:57,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:43:57,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:43:57,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:43:57,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:43:57,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:43:57,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:43:57,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:43:57,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:43:57,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:43:57,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:43:57,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:43:57,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:43:57,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:43:57,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:43:57,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:43:57,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:43:57,672 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:43:57,673 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:43:57,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2019-12-18 15:43:57,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee620086/680dad886eeb4cac9d4206fdc69ce1da/FLAG1bb5fa244 [2019-12-18 15:43:58,275 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:43:58,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2019-12-18 15:43:58,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee620086/680dad886eeb4cac9d4206fdc69ce1da/FLAG1bb5fa244 [2019-12-18 15:43:58,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee620086/680dad886eeb4cac9d4206fdc69ce1da [2019-12-18 15:43:58,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:43:58,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:43:58,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:43:58,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:43:58,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:43:58,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:43:58" (1/1) ... [2019-12-18 15:43:58,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b0a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:58, skipping insertion in model container [2019-12-18 15:43:58,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:43:58" (1/1) ... [2019-12-18 15:43:58,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:43:58,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:43:59,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:43:59,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:43:59,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:43:59,268 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:43:59,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59 WrapperNode [2019-12-18 15:43:59,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:43:59,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:43:59,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:43:59,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:43:59,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:43:59,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:43:59,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:43:59,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:43:59,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... [2019-12-18 15:43:59,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:43:59,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:43:59,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:43:59,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:43:59,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-18 15:43:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:43:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:43:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2019-12-18 15:43:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2019-12-18 15:43:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:43:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:43:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:43:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:43:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2019-12-18 15:43:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2019-12-18 15:43:59,411 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:43:59,545 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_take_read_lock_returnLabel [2019-12-18 15:43:59,765 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_take_write_lock_returnLabel [2019-12-18 15:43:59,775 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:43:59,775 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-18 15:43:59,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:43:59 BoogieIcfgContainer [2019-12-18 15:43:59,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:43:59,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:43:59,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:43:59,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:43:59,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:43:58" (1/3) ... [2019-12-18 15:43:59,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc230aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:43:59, skipping insertion in model container [2019-12-18 15:43:59,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:59" (2/3) ... [2019-12-18 15:43:59,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc230aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:43:59, skipping insertion in model container [2019-12-18 15:43:59,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:43:59" (3/3) ... [2019-12-18 15:43:59,784 INFO L109 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2019-12-18 15:43:59,793 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:43:59,793 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:43:59,799 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:43:59,800 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:43:59,833 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,833 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,834 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,834 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,835 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,835 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,835 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,836 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,837 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,837 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,837 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,838 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,838 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,838 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,838 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,839 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,839 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,839 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,840 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,840 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,840 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,840 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,841 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,841 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,841 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,841 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,842 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,842 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,842 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,843 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,843 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,843 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,843 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,844 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,848 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,848 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,848 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,849 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,857 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,857 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,858 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,858 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,858 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork1_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,860 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,861 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,861 WARN L315 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,861 WARN L315 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,874 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,875 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,875 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,875 WARN L315 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,876 WARN L315 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:59,918 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 15:43:59,940 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:43:59,940 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:43:59,940 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:43:59,940 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:43:59,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:43:59,941 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:43:59,941 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:43:59,941 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:43:59,954 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 98 transitions [2019-12-18 15:43:59,956 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions [2019-12-18 15:44:00,032 INFO L126 PetriNetUnfolder]: 19/132 cut-off events. [2019-12-18 15:44:00,032 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:44:00,048 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 7. Compared 307 event pairs. 87/215 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2019-12-18 15:44:00,058 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions [2019-12-18 15:44:00,118 INFO L126 PetriNetUnfolder]: 19/132 cut-off events. [2019-12-18 15:44:00,122 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:44:00,127 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 7. Compared 307 event pairs. 87/215 useless extension candidates. Maximal degree in co-relation 89. Up to 12 conditions per place. [2019-12-18 15:44:00,137 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2238 [2019-12-18 15:44:00,139 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:44:01,696 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-12-18 15:44:01,804 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7152 [2019-12-18 15:44:01,804 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-18 15:44:01,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 57 transitions [2019-12-18 15:44:02,237 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5381 states. [2019-12-18 15:44:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states. [2019-12-18 15:44:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 15:44:02,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:02,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:02,250 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-18 15:44:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1104717079, now seen corresponding path program 1 times [2019-12-18 15:44:02,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:02,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100057369] [2019-12-18 15:44:02,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:02,533 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-18 15:44:02,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100057369] [2019-12-18 15:44:02,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:44:02,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:44:02,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895575805] [2019-12-18 15:44:02,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:44:02,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:02,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:44:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:44:02,563 INFO L87 Difference]: Start difference. First operand 5381 states. Second operand 4 states. [2019-12-18 15:44:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:02,887 INFO L93 Difference]: Finished difference Result 10812 states and 36249 transitions. [2019-12-18 15:44:02,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:44:02,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-18 15:44:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:03,004 INFO L225 Difference]: With dead ends: 10812 [2019-12-18 15:44:03,007 INFO L226 Difference]: Without dead ends: 7730 [2019-12-18 15:44:03,008 INFO L631 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-18 15:44:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2019-12-18 15:44:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 5052. [2019-12-18 15:44:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5052 states. [2019-12-18 15:44:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 17159 transitions. [2019-12-18 15:44:03,415 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 17159 transitions. Word has length 8 [2019-12-18 15:44:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:03,415 INFO L462 AbstractCegarLoop]: Abstraction has 5052 states and 17159 transitions. [2019-12-18 15:44:03,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:44:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 17159 transitions. [2019-12-18 15:44:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:44:03,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:03,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:03,420 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-18 15:44:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1286591340, now seen corresponding path program 1 times [2019-12-18 15:44:03,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:03,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442899075] [2019-12-18 15:44:03,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:03,535 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-18 15:44:03,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442899075] [2019-12-18 15:44:03,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:44:03,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:44:03,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084278292] [2019-12-18 15:44:03,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:44:03,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:44:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:44:03,540 INFO L87 Difference]: Start difference. First operand 5052 states and 17159 transitions. Second operand 3 states. [2019-12-18 15:44:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:03,629 INFO L93 Difference]: Finished difference Result 4317 states and 12958 transitions. [2019-12-18 15:44:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:44:03,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-18 15:44:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:03,660 INFO L225 Difference]: With dead ends: 4317 [2019-12-18 15:44:03,660 INFO L226 Difference]: Without dead ends: 4275 [2019-12-18 15:44:03,662 INFO L631 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-18 15:44:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-18 15:44:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2019-12-18 15:44:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-18 15:44:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 12848 transitions. [2019-12-18 15:44:03,801 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 12848 transitions. Word has length 10 [2019-12-18 15:44:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:03,801 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 12848 transitions. [2019-12-18 15:44:03,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:44:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 12848 transitions. [2019-12-18 15:44:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:44:03,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:03,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:03,808 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-18 15:44:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -755937034, now seen corresponding path program 2 times [2019-12-18 15:44:03,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:03,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484061956] [2019-12-18 15:44:03,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:03,908 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-18 15:44:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484061956] [2019-12-18 15:44:03,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:44:03,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:44:03,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320347544] [2019-12-18 15:44:03,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:44:03,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:44:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:44:03,910 INFO L87 Difference]: Start difference. First operand 4275 states and 12848 transitions. Second operand 4 states. [2019-12-18 15:44:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:03,972 INFO L93 Difference]: Finished difference Result 2906 states and 7004 transitions. [2019-12-18 15:44:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:44:03,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-18 15:44:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:03,990 INFO L225 Difference]: With dead ends: 2906 [2019-12-18 15:44:03,990 INFO L226 Difference]: Without dead ends: 2798 [2019-12-18 15:44:03,991 INFO L631 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-18 15:44:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-12-18 15:44:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2390. [2019-12-18 15:44:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-12-18 15:44:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 5909 transitions. [2019-12-18 15:44:04,068 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 5909 transitions. Word has length 10 [2019-12-18 15:44:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:04,069 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 5909 transitions. [2019-12-18 15:44:04,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:44:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 5909 transitions. [2019-12-18 15:44:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 15:44:04,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:04,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:04,070 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-18 15:44:04,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash 823084110, now seen corresponding path program 1 times [2019-12-18 15:44:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:04,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105842589] [2019-12-18 15:44:04,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:04,101 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-18 15:44:04,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105842589] [2019-12-18 15:44:04,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:44:04,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:44:04,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891534486] [2019-12-18 15:44:04,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:44:04,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:44:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:44:04,104 INFO L87 Difference]: Start difference. First operand 2390 states and 5909 transitions. Second operand 4 states. [2019-12-18 15:44:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:04,173 INFO L93 Difference]: Finished difference Result 2639 states and 6454 transitions. [2019-12-18 15:44:04,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:44:04,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 15:44:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:04,182 INFO L225 Difference]: With dead ends: 2639 [2019-12-18 15:44:04,183 INFO L226 Difference]: Without dead ends: 1900 [2019-12-18 15:44:04,183 INFO L631 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-18 15:44:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-12-18 15:44:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1546. [2019-12-18 15:44:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-12-18 15:44:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 3824 transitions. [2019-12-18 15:44:04,266 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 3824 transitions. Word has length 12 [2019-12-18 15:44:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:04,267 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 3824 transitions. [2019-12-18 15:44:04,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:44:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 3824 transitions. [2019-12-18 15:44:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:44:04,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:04,270 INFO L411 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-18 15:44:04,270 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-18 15:44:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash -89098316, now seen corresponding path program 1 times [2019-12-18 15:44:04,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:04,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624340261] [2019-12-18 15:44:04,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:04,341 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-18 15:44:04,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624340261] [2019-12-18 15:44:04,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:44:04,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:44:04,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828051460] [2019-12-18 15:44:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:44:04,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:44:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:44:04,344 INFO L87 Difference]: Start difference. First operand 1546 states and 3824 transitions. Second operand 6 states. [2019-12-18 15:44:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:04,439 INFO L93 Difference]: Finished difference Result 1759 states and 4308 transitions. [2019-12-18 15:44:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:44:04,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-18 15:44:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:04,453 INFO L225 Difference]: With dead ends: 1759 [2019-12-18 15:44:04,454 INFO L226 Difference]: Without dead ends: 1641 [2019-12-18 15:44:04,454 INFO L631 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-18 15:44:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-18 15:44:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1509. [2019-12-18 15:44:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-18 15:44:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3739 transitions. [2019-12-18 15:44:04,494 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3739 transitions. Word has length 20 [2019-12-18 15:44:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:04,494 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 3739 transitions. [2019-12-18 15:44:04,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:44:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3739 transitions. [2019-12-18 15:44:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:44:04,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:04,496 INFO L411 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-18 15:44:04,497 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-18 15:44:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1516834824, now seen corresponding path program 2 times [2019-12-18 15:44:04,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:04,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079310880] [2019-12-18 15:44:04,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:44:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:44:04,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:44:04,571 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:44:04,575 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 |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|) (= (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|) (= 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-18 15:44:04,576 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-18 15:44:04,576 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-18 15:44:04,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [218] [218] readerENTRY-->L692: Formula: (and (= |v_readerThread1of1ForFork1_#in~arg.offset_4| v_readerThread1of1ForFork1_~arg.offset_4) (= |v_readerThread1of1ForFork1_#in~arg.base_4| v_readerThread1of1ForFork1_~arg.base_4) (= v_~w~0_44 0) (= 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_4, readerThread1of1ForFork1_#in~arg.base=|v_readerThread1of1ForFork1_#in~arg.base_4|, readerThread1of1ForFork1_~arg.base=v_readerThread1of1ForFork1_~arg.base_4, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_36, ~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-18 15:44:04,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [219] [219] L694-->L694-3: Formula: (= ~x~0_In-1619144700 ~y~0_In-1619144700) InVars {~y~0=~y~0_In-1619144700, ~x~0=~x~0_In-1619144700} OutVars{~y~0=~y~0_In-1619144700, ~x~0=~x~0_In-1619144700} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:44:04,579 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-18 15:44:04,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [208] [208] readerENTRY-->L692: Formula: (and (= v_~r~0_17 (+ v_~r~0_18 1)) (= v_~w~0_18 0) (= v_readerThread1of1ForFork3_~arg.base_4 |v_readerThread1of1ForFork3_#in~arg.base_4|) (= v_readerThread1of1ForFork3_~arg.offset_4 |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_16, ~w~0=v_~w~0_18, readerThread1of1ForFork3_~arg.offset=v_readerThread1of1ForFork3_~arg.offset_4, readerThread1of1ForFork3_~arg.base=v_readerThread1of1ForFork3_~arg.base_4, 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-18 15:44:04,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [226] [226] L696-->readerEXIT: Formula: (and (= |v_readerThread1of1ForFork1_#res.base_5| 0) (= |v_readerThread1of1ForFork1_#res.offset_5| 0) (= v_readerThread1of1ForFork1_~l~0_57 v_~r~0_75)) InVars {readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_57} OutVars{readerThread1of1ForFork1_#res.base=|v_readerThread1of1ForFork1_#res.base_5|, readerThread1of1ForFork1_#res.offset=|v_readerThread1of1ForFork1_#res.offset_5|, readerThread1of1ForFork1_~l~0=v_readerThread1of1ForFork1_~l~0_57, ~r~0=v_~r~0_75} AuxVars[] AssignedVars[readerThread1of1ForFork1_#res.base, readerThread1of1ForFork1_#res.offset, ~r~0] because there is no mapped edge [2019-12-18 15:44:04,581 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-18 15:44:04,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:44:04 BasicIcfg [2019-12-18 15:44:04,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:44:04,635 INFO L168 Benchmark]: Toolchain (without parser) took 6071.28 ms. Allocated memory was 138.9 MB in the beginning and 293.1 MB in the end (delta: 154.1 MB). Free memory was 102.4 MB in the beginning and 164.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,637 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.58 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 162.7 MB in the end (delta: -60.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.50 ms. Allocated memory is still 203.4 MB. Free memory was 162.7 MB in the beginning and 160.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,646 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 203.4 MB. Free memory was 160.1 MB in the beginning and 158.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,647 INFO L168 Benchmark]: RCFGBuilder took 424.99 ms. Allocated memory is still 203.4 MB. Free memory was 158.8 MB in the beginning and 137.5 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,647 INFO L168 Benchmark]: TraceAbstraction took 4854.57 ms. Allocated memory was 203.4 MB in the beginning and 293.1 MB in the end (delta: 89.7 MB). Free memory was 136.8 MB in the beginning and 164.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:04,661 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.40 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.58 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 162.7 MB in the end (delta: -60.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.50 ms. Allocated memory is still 203.4 MB. Free memory was 162.7 MB in the beginning and 160.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 203.4 MB. Free memory was 160.1 MB in the beginning and 158.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.99 ms. Allocated memory is still 203.4 MB. Free memory was 158.8 MB in the beginning and 137.5 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4854.57 ms. Allocated memory was 203.4 MB in the beginning and 293.1 MB in the end (delta: 89.7 MB). Free memory was 136.8 MB in the beginning and 164.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 61.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 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.3s, 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: 4.6s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 412 SDtfs, 418 SDslu, 510 SDs, 0 SdLazy, 150 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s 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.7s AutomataMinimizationTime, 5 MinimizatonAttempts, 3572 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s 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...