/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-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:02:06,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:02:06,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:02:06,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:02:06,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:02:06,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:02:06,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:02:06,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:02:06,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:02:06,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:02:06,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:02:06,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:02:06,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:02:06,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:02:06,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:02:06,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:02:06,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:02:06,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:02:06,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:02:06,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:02:06,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:02:06,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:02:06,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:02:06,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:02:06,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:02:06,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:02:06,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:02:06,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:02:06,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:02:06,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:02:06,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:02:06,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:02:06,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:02:06,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:02:06,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:02:06,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:02:06,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:02:06,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:02:06,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:02:06,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:02:06,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:02:06,089 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 17:02:06,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:02:06,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:02:06,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:02:06,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:02:06,126 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:02:06,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:02:06,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:02:06,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:02:06,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:02:06,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:02:06,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:02:06,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:02:06,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:02:06,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:02:06,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:02:06,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:02:06,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:02:06,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:02:06,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:02:06,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:02:06,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:02:06,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:02:06,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:02:06,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:02:06,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:02:06,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:02:06,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:02:06,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:02:06,430 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:02:06,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-18 17:02:06,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47b9adb/10e77b5e33714eb483506429c94b6165/FLAG24e2e8514 [2019-12-18 17:02:07,102 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:02:07,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2019-12-18 17:02:07,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47b9adb/10e77b5e33714eb483506429c94b6165/FLAG24e2e8514 [2019-12-18 17:02:07,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f47b9adb/10e77b5e33714eb483506429c94b6165 [2019-12-18 17:02:07,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:02:07,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:02:07,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:02:07,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:02:07,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:02:07,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:02:07" (1/1) ... [2019-12-18 17:02:07,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ec3e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:07, skipping insertion in model container [2019-12-18 17:02:07,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:02:07" (1/1) ... [2019-12-18 17:02:07,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:02:07,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:02:07,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:02:08,001 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:02:08,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:02:08,157 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:02:08,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08 WrapperNode [2019-12-18 17:02:08,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:02:08,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:02:08,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:02:08,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:02:08,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:02:08,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:02:08,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:02:08,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:02:08,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (1/1) ... [2019-12-18 17:02:08,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:02:08,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:02:08,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:02:08,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:02:08,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (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 17:02:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:02:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:02:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:02:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:02:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:02:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:02:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:02:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:02:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:02:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:02:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:02:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:02:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:02:08,337 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 17:02:09,136 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:02:09,136 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:02:09,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:09 BoogieIcfgContainer [2019-12-18 17:02:09,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:02:09,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:02:09,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:02:09,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:02:09,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:02:07" (1/3) ... [2019-12-18 17:02:09,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c94c28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:09, skipping insertion in model container [2019-12-18 17:02:09,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:08" (2/3) ... [2019-12-18 17:02:09,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c94c28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:09, skipping insertion in model container [2019-12-18 17:02:09,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:09" (3/3) ... [2019-12-18 17:02:09,146 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2019-12-18 17:02:09,156 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:02:09,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:02:09,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:02:09,164 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:02:09,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,252 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,257 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:09,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:02:09,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:02:09,290 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:02:09,290 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:02:09,290 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:02:09,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:02:09,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:02:09,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:02:09,291 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:02:09,308 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:02:09,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:02:09,397 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:02:09,398 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:09,415 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:02:09,441 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:02:09,489 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:02:09,489 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:09,496 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:02:09,516 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 17:02:09,518 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:02:14,611 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:02:14,754 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:02:14,783 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79058 [2019-12-18 17:02:14,783 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 17:02:14,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 17:02:33,110 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115078 states. [2019-12-18 17:02:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 115078 states. [2019-12-18 17:02:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:02:33,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:33,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:02:33,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash 811621075, now seen corresponding path program 1 times [2019-12-18 17:02:33,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:33,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627320996] [2019-12-18 17:02:33,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:33,357 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 17:02:33,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627320996] [2019-12-18 17:02:33,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:33,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:02:33,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337274063] [2019-12-18 17:02:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:33,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:33,380 INFO L87 Difference]: Start difference. First operand 115078 states. Second operand 3 states. [2019-12-18 17:02:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:34,444 INFO L93 Difference]: Finished difference Result 114778 states and 493920 transitions. [2019-12-18 17:02:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:34,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:02:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:38,446 INFO L225 Difference]: With dead ends: 114778 [2019-12-18 17:02:38,446 INFO L226 Difference]: Without dead ends: 112412 [2019-12-18 17:02:38,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112412 states. [2019-12-18 17:02:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112412 to 112412. [2019-12-18 17:02:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112412 states. [2019-12-18 17:02:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112412 states to 112412 states and 484274 transitions. [2019-12-18 17:02:45,779 INFO L78 Accepts]: Start accepts. Automaton has 112412 states and 484274 transitions. Word has length 5 [2019-12-18 17:02:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:45,779 INFO L462 AbstractCegarLoop]: Abstraction has 112412 states and 484274 transitions. [2019-12-18 17:02:45,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 112412 states and 484274 transitions. [2019-12-18 17:02:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:02:45,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:45,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:45,783 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash -287251583, now seen corresponding path program 1 times [2019-12-18 17:02:45,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:45,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417509761] [2019-12-18 17:02:45,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:45,895 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 17:02:45,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417509761] [2019-12-18 17:02:45,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:45,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:45,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309900897] [2019-12-18 17:02:45,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:45,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:45,899 INFO L87 Difference]: Start difference. First operand 112412 states and 484274 transitions. Second operand 4 states. [2019-12-18 17:02:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:51,462 INFO L93 Difference]: Finished difference Result 180702 states and 747767 transitions. [2019-12-18 17:02:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:02:51,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:02:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:52,120 INFO L225 Difference]: With dead ends: 180702 [2019-12-18 17:02:52,120 INFO L226 Difference]: Without dead ends: 180653 [2019-12-18 17:02:52,121 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 17:02:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180653 states. [2019-12-18 17:03:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180653 to 165577. [2019-12-18 17:03:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165577 states. [2019-12-18 17:03:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165577 states to 165577 states and 693075 transitions. [2019-12-18 17:03:09,062 INFO L78 Accepts]: Start accepts. Automaton has 165577 states and 693075 transitions. Word has length 11 [2019-12-18 17:03:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:09,062 INFO L462 AbstractCegarLoop]: Abstraction has 165577 states and 693075 transitions. [2019-12-18 17:03:09,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 165577 states and 693075 transitions. [2019-12-18 17:03:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:03:09,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:09,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:09,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 228163746, now seen corresponding path program 1 times [2019-12-18 17:03:09,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:09,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325055609] [2019-12-18 17:03:09,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:09,178 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 17:03:09,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325055609] [2019-12-18 17:03:09,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:09,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:09,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872167123] [2019-12-18 17:03:09,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:03:09,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:03:09,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:09,180 INFO L87 Difference]: Start difference. First operand 165577 states and 693075 transitions. Second operand 4 states. [2019-12-18 17:03:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:10,700 INFO L93 Difference]: Finished difference Result 235681 states and 964563 transitions. [2019-12-18 17:03:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:03:10,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:03:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:19,093 INFO L225 Difference]: With dead ends: 235681 [2019-12-18 17:03:19,093 INFO L226 Difference]: Without dead ends: 235618 [2019-12-18 17:03:19,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235618 states. [2019-12-18 17:03:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235618 to 199613. [2019-12-18 17:03:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199613 states. [2019-12-18 17:03:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199613 states to 199613 states and 830031 transitions. [2019-12-18 17:03:29,610 INFO L78 Accepts]: Start accepts. Automaton has 199613 states and 830031 transitions. Word has length 13 [2019-12-18 17:03:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:29,611 INFO L462 AbstractCegarLoop]: Abstraction has 199613 states and 830031 transitions. [2019-12-18 17:03:29,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 199613 states and 830031 transitions. [2019-12-18 17:03:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:03:29,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:29,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:29,615 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 986322522, now seen corresponding path program 1 times [2019-12-18 17:03:29,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:29,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102754464] [2019-12-18 17:03:29,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:29,703 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 17:03:29,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102754464] [2019-12-18 17:03:29,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:29,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:29,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112793021] [2019-12-18 17:03:29,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:29,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:29,709 INFO L87 Difference]: Start difference. First operand 199613 states and 830031 transitions. Second operand 3 states. [2019-12-18 17:03:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:29,881 INFO L93 Difference]: Finished difference Result 39466 states and 128760 transitions. [2019-12-18 17:03:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:29,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:03:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:29,957 INFO L225 Difference]: With dead ends: 39466 [2019-12-18 17:03:29,958 INFO L226 Difference]: Without dead ends: 39466 [2019-12-18 17:03:29,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39466 states. [2019-12-18 17:03:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39466 to 39466. [2019-12-18 17:03:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39466 states. [2019-12-18 17:03:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39466 states to 39466 states and 128760 transitions. [2019-12-18 17:03:32,028 INFO L78 Accepts]: Start accepts. Automaton has 39466 states and 128760 transitions. Word has length 13 [2019-12-18 17:03:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:32,028 INFO L462 AbstractCegarLoop]: Abstraction has 39466 states and 128760 transitions. [2019-12-18 17:03:32,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39466 states and 128760 transitions. [2019-12-18 17:03:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 17:03:32,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:32,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:32,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash -462367392, now seen corresponding path program 1 times [2019-12-18 17:03:32,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:32,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445057597] [2019-12-18 17:03:32,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:32,118 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 17:03:32,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445057597] [2019-12-18 17:03:32,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:32,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:32,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770241491] [2019-12-18 17:03:32,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:32,120 INFO L87 Difference]: Start difference. First operand 39466 states and 128760 transitions. Second operand 5 states. [2019-12-18 17:03:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:32,912 INFO L93 Difference]: Finished difference Result 53323 states and 170492 transitions. [2019-12-18 17:03:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:32,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 17:03:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:32,998 INFO L225 Difference]: With dead ends: 53323 [2019-12-18 17:03:32,998 INFO L226 Difference]: Without dead ends: 53310 [2019-12-18 17:03:32,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53310 states. [2019-12-18 17:03:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53310 to 39837. [2019-12-18 17:03:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39837 states. [2019-12-18 17:03:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39837 states to 39837 states and 129810 transitions. [2019-12-18 17:03:33,789 INFO L78 Accepts]: Start accepts. Automaton has 39837 states and 129810 transitions. Word has length 19 [2019-12-18 17:03:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:33,790 INFO L462 AbstractCegarLoop]: Abstraction has 39837 states and 129810 transitions. [2019-12-18 17:03:33,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 39837 states and 129810 transitions. [2019-12-18 17:03:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:03:33,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:33,803 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, 1, 1, 1, 1, 1] [2019-12-18 17:03:33,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash 781437825, now seen corresponding path program 1 times [2019-12-18 17:03:33,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:33,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084376593] [2019-12-18 17:03:33,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:33,888 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 17:03:33,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084376593] [2019-12-18 17:03:33,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:33,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:33,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497349796] [2019-12-18 17:03:34,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:03:34,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:03:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:34,505 INFO L87 Difference]: Start difference. First operand 39837 states and 129810 transitions. Second operand 4 states. [2019-12-18 17:03:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:34,552 INFO L93 Difference]: Finished difference Result 7581 states and 20788 transitions. [2019-12-18 17:03:34,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:03:34,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:03:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:34,567 INFO L225 Difference]: With dead ends: 7581 [2019-12-18 17:03:34,567 INFO L226 Difference]: Without dead ends: 7581 [2019-12-18 17:03:34,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-12-18 17:03:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7441. [2019-12-18 17:03:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2019-12-18 17:03:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 20388 transitions. [2019-12-18 17:03:34,668 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 20388 transitions. Word has length 25 [2019-12-18 17:03:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:34,668 INFO L462 AbstractCegarLoop]: Abstraction has 7441 states and 20388 transitions. [2019-12-18 17:03:34,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 20388 transitions. [2019-12-18 17:03:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:03:34,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:34,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:34,681 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1015424040, now seen corresponding path program 1 times [2019-12-18 17:03:34,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:34,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791047224] [2019-12-18 17:03:34,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:34,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791047224] [2019-12-18 17:03:34,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:34,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:03:34,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134854284] [2019-12-18 17:03:34,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:34,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:34,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:34,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:34,761 INFO L87 Difference]: Start difference. First operand 7441 states and 20388 transitions. Second operand 5 states. [2019-12-18 17:03:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:34,807 INFO L93 Difference]: Finished difference Result 5402 states and 15528 transitions. [2019-12-18 17:03:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:03:34,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 17:03:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:34,816 INFO L225 Difference]: With dead ends: 5402 [2019-12-18 17:03:34,816 INFO L226 Difference]: Without dead ends: 5402 [2019-12-18 17:03:34,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-18 17:03:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4989. [2019-12-18 17:03:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-18 17:03:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 14411 transitions. [2019-12-18 17:03:34,908 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 14411 transitions. Word has length 37 [2019-12-18 17:03:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:34,908 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 14411 transitions. [2019-12-18 17:03:34,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 14411 transitions. [2019-12-18 17:03:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:03:34,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:34,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:34,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:34,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1550906862, now seen corresponding path program 1 times [2019-12-18 17:03:34,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:34,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87256453] [2019-12-18 17:03:34,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:34,987 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 17:03:34,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87256453] [2019-12-18 17:03:34,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:34,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:34,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506296623] [2019-12-18 17:03:34,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:34,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:34,989 INFO L87 Difference]: Start difference. First operand 4989 states and 14411 transitions. Second operand 3 states. [2019-12-18 17:03:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:35,047 INFO L93 Difference]: Finished difference Result 4998 states and 14420 transitions. [2019-12-18 17:03:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:35,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:03:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:35,055 INFO L225 Difference]: With dead ends: 4998 [2019-12-18 17:03:35,055 INFO L226 Difference]: Without dead ends: 4998 [2019-12-18 17:03:35,056 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 17:03:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-18 17:03:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4994. [2019-12-18 17:03:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 17:03:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14416 transitions. [2019-12-18 17:03:35,125 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14416 transitions. Word has length 65 [2019-12-18 17:03:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:35,125 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14416 transitions. [2019-12-18 17:03:35,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14416 transitions. [2019-12-18 17:03:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:03:35,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:35,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:35,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1256158932, now seen corresponding path program 1 times [2019-12-18 17:03:35,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:35,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039402002] [2019-12-18 17:03:35,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:35,256 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 17:03:35,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039402002] [2019-12-18 17:03:35,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:35,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:35,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163091475] [2019-12-18 17:03:35,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:35,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:35,259 INFO L87 Difference]: Start difference. First operand 4994 states and 14416 transitions. Second operand 3 states. [2019-12-18 17:03:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:35,288 INFO L93 Difference]: Finished difference Result 4994 states and 14195 transitions. [2019-12-18 17:03:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:35,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:03:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:35,296 INFO L225 Difference]: With dead ends: 4994 [2019-12-18 17:03:35,296 INFO L226 Difference]: Without dead ends: 4994 [2019-12-18 17:03:35,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-18 17:03:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4994. [2019-12-18 17:03:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2019-12-18 17:03:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 14195 transitions. [2019-12-18 17:03:35,399 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 14195 transitions. Word has length 65 [2019-12-18 17:03:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:35,399 INFO L462 AbstractCegarLoop]: Abstraction has 4994 states and 14195 transitions. [2019-12-18 17:03:35,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 14195 transitions. [2019-12-18 17:03:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:35,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:35,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:35,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1760720695, now seen corresponding path program 1 times [2019-12-18 17:03:35,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:35,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081518219] [2019-12-18 17:03:35,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:35,510 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 17:03:35,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081518219] [2019-12-18 17:03:35,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:35,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:35,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436551287] [2019-12-18 17:03:35,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:35,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:35,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:35,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:35,513 INFO L87 Difference]: Start difference. First operand 4994 states and 14195 transitions. Second operand 5 states. [2019-12-18 17:03:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:35,802 INFO L93 Difference]: Finished difference Result 7330 states and 20675 transitions. [2019-12-18 17:03:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:03:35,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 17:03:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:35,813 INFO L225 Difference]: With dead ends: 7330 [2019-12-18 17:03:35,813 INFO L226 Difference]: Without dead ends: 7330 [2019-12-18 17:03:35,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2019-12-18 17:03:35,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6065. [2019-12-18 17:03:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6065 states. [2019-12-18 17:03:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 17257 transitions. [2019-12-18 17:03:35,906 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 17257 transitions. Word has length 66 [2019-12-18 17:03:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:35,906 INFO L462 AbstractCegarLoop]: Abstraction has 6065 states and 17257 transitions. [2019-12-18 17:03:35,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 17257 transitions. [2019-12-18 17:03:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:35,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:35,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:35,915 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1764113003, now seen corresponding path program 2 times [2019-12-18 17:03:35,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:35,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454383932] [2019-12-18 17:03:35,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:36,009 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 17:03:36,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454383932] [2019-12-18 17:03:36,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:36,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:36,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96934624] [2019-12-18 17:03:36,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:36,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:36,011 INFO L87 Difference]: Start difference. First operand 6065 states and 17257 transitions. Second operand 5 states. [2019-12-18 17:03:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:36,371 INFO L93 Difference]: Finished difference Result 8773 states and 24705 transitions. [2019-12-18 17:03:36,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:03:36,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 17:03:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:36,386 INFO L225 Difference]: With dead ends: 8773 [2019-12-18 17:03:36,386 INFO L226 Difference]: Without dead ends: 8773 [2019-12-18 17:03:36,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-18 17:03:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 6413. [2019-12-18 17:03:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6413 states. [2019-12-18 17:03:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 18290 transitions. [2019-12-18 17:03:36,538 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 18290 transitions. Word has length 66 [2019-12-18 17:03:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:36,538 INFO L462 AbstractCegarLoop]: Abstraction has 6413 states and 18290 transitions. [2019-12-18 17:03:36,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 18290 transitions. [2019-12-18 17:03:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:36,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:36,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:36,547 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 956425645, now seen corresponding path program 3 times [2019-12-18 17:03:36,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:36,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618055131] [2019-12-18 17:03:36,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:36,682 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 17:03:36,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618055131] [2019-12-18 17:03:36,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:36,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:03:36,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524586982] [2019-12-18 17:03:36,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:36,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:36,684 INFO L87 Difference]: Start difference. First operand 6413 states and 18290 transitions. Second operand 6 states. [2019-12-18 17:03:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:37,075 INFO L93 Difference]: Finished difference Result 8691 states and 24471 transitions. [2019-12-18 17:03:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:37,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 17:03:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:37,088 INFO L225 Difference]: With dead ends: 8691 [2019-12-18 17:03:37,089 INFO L226 Difference]: Without dead ends: 8691 [2019-12-18 17:03:37,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2019-12-18 17:03:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 6840. [2019-12-18 17:03:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2019-12-18 17:03:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19489 transitions. [2019-12-18 17:03:37,199 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19489 transitions. Word has length 66 [2019-12-18 17:03:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 6840 states and 19489 transitions. [2019-12-18 17:03:37,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19489 transitions. [2019-12-18 17:03:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:03:37,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:37,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:37,209 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 426723893, now seen corresponding path program 4 times [2019-12-18 17:03:37,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:37,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75672804] [2019-12-18 17:03:37,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:37,293 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 17:03:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75672804] [2019-12-18 17:03:37,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:37,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:37,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777364407] [2019-12-18 17:03:37,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:37,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:37,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:37,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:37,295 INFO L87 Difference]: Start difference. First operand 6840 states and 19489 transitions. Second operand 3 states. [2019-12-18 17:03:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:37,553 INFO L93 Difference]: Finished difference Result 6840 states and 19488 transitions. [2019-12-18 17:03:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:37,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:03:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:37,562 INFO L225 Difference]: With dead ends: 6840 [2019-12-18 17:03:37,563 INFO L226 Difference]: Without dead ends: 6840 [2019-12-18 17:03:37,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2019-12-18 17:03:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4178. [2019-12-18 17:03:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-12-18 17:03:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 12093 transitions. [2019-12-18 17:03:37,643 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 12093 transitions. Word has length 66 [2019-12-18 17:03:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:37,644 INFO L462 AbstractCegarLoop]: Abstraction has 4178 states and 12093 transitions. [2019-12-18 17:03:37,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 12093 transitions. [2019-12-18 17:03:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:03:37,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:37,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:37,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1488093963, now seen corresponding path program 1 times [2019-12-18 17:03:37,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:37,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616570617] [2019-12-18 17:03:37,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:37,714 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 17:03:37,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616570617] [2019-12-18 17:03:37,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:37,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:37,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338421569] [2019-12-18 17:03:37,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:37,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:37,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:37,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:37,716 INFO L87 Difference]: Start difference. First operand 4178 states and 12093 transitions. Second operand 3 states. [2019-12-18 17:03:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:37,742 INFO L93 Difference]: Finished difference Result 3871 states and 10957 transitions. [2019-12-18 17:03:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:37,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:03:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:37,748 INFO L225 Difference]: With dead ends: 3871 [2019-12-18 17:03:37,748 INFO L226 Difference]: Without dead ends: 3871 [2019-12-18 17:03:37,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-18 17:03:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3183. [2019-12-18 17:03:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-18 17:03:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 9013 transitions. [2019-12-18 17:03:37,822 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 9013 transitions. Word has length 67 [2019-12-18 17:03:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:37,822 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 9013 transitions. [2019-12-18 17:03:37,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 9013 transitions. [2019-12-18 17:03:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:37,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:37,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:37,832 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2084050195, now seen corresponding path program 1 times [2019-12-18 17:03:37,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:37,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505885594] [2019-12-18 17:03:37,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:38,046 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 17:03:38,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505885594] [2019-12-18 17:03:38,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:38,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:38,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705690016] [2019-12-18 17:03:38,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:03:38,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:03:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:38,049 INFO L87 Difference]: Start difference. First operand 3183 states and 9013 transitions. Second operand 9 states. [2019-12-18 17:03:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:38,582 INFO L93 Difference]: Finished difference Result 6802 states and 19408 transitions. [2019-12-18 17:03:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:03:38,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-18 17:03:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:38,589 INFO L225 Difference]: With dead ends: 6802 [2019-12-18 17:03:38,590 INFO L226 Difference]: Without dead ends: 3670 [2019-12-18 17:03:38,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:03:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-18 17:03:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 2607. [2019-12-18 17:03:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-12-18 17:03:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 7312 transitions. [2019-12-18 17:03:38,662 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 7312 transitions. Word has length 68 [2019-12-18 17:03:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:38,662 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 7312 transitions. [2019-12-18 17:03:38,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:03:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 7312 transitions. [2019-12-18 17:03:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:38,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:38,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:38,668 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash -293308025, now seen corresponding path program 2 times [2019-12-18 17:03:38,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:38,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124952425] [2019-12-18 17:03:38,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:38,835 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 17:03:38,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124952425] [2019-12-18 17:03:38,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:38,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:38,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621235220] [2019-12-18 17:03:38,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:38,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:38,839 INFO L87 Difference]: Start difference. First operand 2607 states and 7312 transitions. Second operand 6 states. [2019-12-18 17:03:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:38,960 INFO L93 Difference]: Finished difference Result 4997 states and 14053 transitions. [2019-12-18 17:03:38,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:03:38,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 17:03:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:38,965 INFO L225 Difference]: With dead ends: 4997 [2019-12-18 17:03:38,965 INFO L226 Difference]: Without dead ends: 2359 [2019-12-18 17:03:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:03:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-12-18 17:03:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1963. [2019-12-18 17:03:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 17:03:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5460 transitions. [2019-12-18 17:03:39,036 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5460 transitions. Word has length 68 [2019-12-18 17:03:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:39,036 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5460 transitions. [2019-12-18 17:03:39,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5460 transitions. [2019-12-18 17:03:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 17:03:39,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:39,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:39,041 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1266757317, now seen corresponding path program 3 times [2019-12-18 17:03:39,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:39,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121523443] [2019-12-18 17:03:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:39,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:03:39,223 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:03:39,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t760~0.base_20|) |v_ULTIMATE.start_main_~#t760~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX~0_23) (= (store .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20| 1) |v_#valid_55|) (= v_~z~0_18 0) (= 0 v_~weak$$choice0~0_14) (= v_~x$flush_delayed~0_41 0) (= 0 v_~x$r_buff0_thd3~0_99) (= v_~x$r_buff1_thd1~0_192 0) (= 0 v_~x$w_buff0~0_203) (= v_~weak$$choice2~0_116 0) (= 0 |v_ULTIMATE.start_main_~#t760~0.offset_17|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$r_buff1_thd3~0_193) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_195) (= v_~x$mem_tmp~0_22 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t760~0.base_20|) (= v_~__unbuffered_p2_EBX~0_23 0) (= 0 v_~x$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_28 0) (= v_~x$r_buff0_thd0~0_335 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_279 0) (= 0 v_~x$w_buff1_used~0_401) (= v_~__unbuffered_cnt~0_145 0) (= 0 v_~x$r_buff1_thd2~0_186) (= 0 v_~x$w_buff0_used~0_743) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t760~0.base_20| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= 0 v_~x~0_213) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t760~0.base_20|) 0) (= 0 v_~x$r_buff0_thd1~0_88) (= 0 |v_#NULL.base_5|) (= v_~y~0_136 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t760~0.base=|v_ULTIMATE.start_main_~#t760~0.base_20|, ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_203, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_41, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_31|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_99, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_23, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_46|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_186, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_50|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_156|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_213, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_33|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_273|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ULTIMATE.start_main_~#t760~0.offset=|v_ULTIMATE.start_main_~#t760~0.offset_17|, ~y~0=v_~y~0_136, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_279, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_21|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_162|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_17|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t760~0.base, ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t761~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t760~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t761~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t762~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:03:39,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L810-1-->L812: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t761~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t761~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t761~0.offset_11|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t761~0.base_13|) |v_ULTIMATE.start_main_~#t761~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t761~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t761~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t761~0.offset=|v_ULTIMATE.start_main_~#t761~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t761~0.base=|v_ULTIMATE.start_main_~#t761~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t761~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t761~0.base] because there is no mapped edge [2019-12-18 17:03:39,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L812-1-->L814: Formula: (and (not (= |v_ULTIMATE.start_main_~#t762~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t762~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t762~0.base_13| 4) |v_#length_15|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t762~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t762~0.base_13|) |v_ULTIMATE.start_main_~#t762~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t762~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t762~0.base=|v_ULTIMATE.start_main_~#t762~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t762~0.offset=|v_ULTIMATE.start_main_~#t762~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t762~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t762~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:03:39,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= (mod v_~x$w_buff1_used~0_145 256) 0) (= v_~x$w_buff0~0_44 v_~x$w_buff1~0_51) (= 2 v_~x$w_buff0~0_43) (= 1 v_~x$w_buff0_used~0_300) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|) (= v_~x$w_buff0_used~0_301 v_~x$w_buff1_used~0_145)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~x$w_buff0~0=v_~x$w_buff0~0_43, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_300} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:03:39,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1777302897 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1777302897 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1777302897| ~x$w_buff1~0_In1777302897) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1777302897| ~x~0_In1777302897) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1777302897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1777302897, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1777302897, ~x~0=~x~0_In1777302897} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1777302897|, ~x$w_buff1~0=~x$w_buff1~0_In1777302897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1777302897, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1777302897, ~x~0=~x~0_In1777302897} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 17:03:39,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= v_~x~0_30 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 17:03:39,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In81815379 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In81815379 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out81815379| |P0Thread1of1ForFork0_#t~ite3_Out81815379|))) (or (and (= ~x~0_In81815379 |P0Thread1of1ForFork0_#t~ite3_Out81815379|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out81815379| ~x$w_buff1~0_In81815379) (not .cse1) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In81815379, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81815379, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In81815379, ~x~0=~x~0_In81815379} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out81815379|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out81815379|, ~x$w_buff1~0=~x$w_buff1~0_In81815379, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81815379, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In81815379, ~x~0=~x~0_In81815379} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:03:39,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1808827622 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1808827622 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1808827622|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1808827622 |P0Thread1of1ForFork0_#t~ite5_Out1808827622|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1808827622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808827622} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1808827622|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1808827622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1808827622} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:03:39,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-62411604 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-62411604 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-62411604 |P2Thread1of1ForFork2_#t~ite17_Out-62411604|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-62411604|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-62411604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-62411604} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-62411604, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-62411604|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-62411604} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 17:03:39,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In2062708083 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2062708083 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2062708083 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In2062708083 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2062708083|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In2062708083 |P2Thread1of1ForFork2_#t~ite18_Out2062708083|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2062708083, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2062708083, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2062708083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2062708083} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2062708083, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2062708083, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2062708083, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2062708083|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2062708083} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 17:03:39,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1157181049 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1157181049 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1157181049 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1157181049 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1157181049|)) (and (= ~x$w_buff1_used~0_In1157181049 |P0Thread1of1ForFork0_#t~ite6_Out1157181049|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1157181049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1157181049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1157181049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1157181049} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1157181049|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1157181049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1157181049, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1157181049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1157181049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:03:39,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1026142935 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1026142935 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1026142935|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1026142935| ~x$r_buff0_thd3~0_In1026142935) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026142935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1026142935} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026142935, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1026142935|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1026142935} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 17:03:39,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1125026322 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1125026322 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1125026322 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1125026322 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1125026322| ~x$r_buff1_thd3~0_In-1125026322) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1125026322| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1125026322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1125026322, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1125026322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1125026322} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1125026322|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1125026322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1125026322, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1125026322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1125026322} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 17:03:39,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork2_#t~ite20_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:03:39,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-182593645 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-182593645 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-182593645| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-182593645| ~x$w_buff0_used~0_In-182593645)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-182593645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-182593645} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-182593645|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-182593645, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-182593645} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:03:39,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In581538047 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In581538047 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In581538047 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In581538047 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In581538047 |P1Thread1of1ForFork1_#t~ite12_Out581538047|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out581538047|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In581538047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In581538047, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In581538047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581538047} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In581538047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In581538047, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out581538047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In581538047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581538047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:03:39,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1535172481 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1535172481 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1535172481) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-1535172481 ~x$r_buff0_thd2~0_Out-1535172481) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1535172481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535172481} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1535172481|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1535172481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535172481} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:03:39,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1153191056 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1153191056 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1153191056 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1153191056 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1153191056|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1153191056| ~x$r_buff1_thd2~0_In1153191056) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1153191056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1153191056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1153191056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1153191056} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1153191056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1153191056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1153191056, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1153191056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1153191056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:03:39,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L768-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:03:39,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-142278941 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-142278941 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-142278941|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-142278941 |P0Thread1of1ForFork0_#t~ite7_Out-142278941|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-142278941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142278941} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-142278941, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-142278941|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142278941} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:03:39,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-263178960 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-263178960 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-263178960 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-263178960 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In-263178960 |P0Thread1of1ForFork0_#t~ite8_Out-263178960|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-263178960|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-263178960, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-263178960, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-263178960, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-263178960} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-263178960, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-263178960|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-263178960, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-263178960, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-263178960} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:03:39,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_40 |v_P0Thread1of1ForFork0_#t~ite8_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 17:03:39,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:03:39,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1248536525 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1248536525 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1248536525| |ULTIMATE.start_main_#t~ite25_Out1248536525|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out1248536525| ~x$w_buff1~0_In1248536525)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1248536525| ~x~0_In1248536525) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1248536525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248536525, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1248536525, ~x~0=~x~0_In1248536525} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1248536525, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1248536525|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1248536525|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1248536525, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1248536525, ~x~0=~x~0_In1248536525} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 17:03:39,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1214522316 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1214522316 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1214522316| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1214522316 |ULTIMATE.start_main_#t~ite26_Out-1214522316|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1214522316, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214522316} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1214522316, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1214522316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214522316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 17:03:39,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1477869131 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1477869131 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1477869131 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1477869131 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1477869131 |ULTIMATE.start_main_#t~ite27_Out1477869131|)) (and (= |ULTIMATE.start_main_#t~ite27_Out1477869131| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1477869131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1477869131, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1477869131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1477869131} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1477869131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1477869131, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1477869131|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1477869131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1477869131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 17:03:39,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1771572258 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1771572258 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1771572258| 0)) (and (= ~x$r_buff0_thd0~0_In1771572258 |ULTIMATE.start_main_#t~ite28_Out1771572258|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1771572258, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1771572258} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1771572258, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1771572258|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1771572258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 17:03:39,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In624349649 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In624349649 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In624349649 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In624349649 256)))) (or (and (= ~x$r_buff1_thd0~0_In624349649 |ULTIMATE.start_main_#t~ite29_Out624349649|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite29_Out624349649|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In624349649, ~x$w_buff1_used~0=~x$w_buff1_used~0_In624349649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In624349649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In624349649} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In624349649, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out624349649|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In624349649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In624349649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In624349649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:03:39,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd0~0_87 v_~x$r_buff0_thd0~0_86)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_86, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:03:39,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L839-->L4: Formula: (and (= v_~x$flush_delayed~0_24 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_25 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_173)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_173, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:03:39,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:03:39,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:03:39 BasicIcfg [2019-12-18 17:03:39,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:03:39,386 INFO L168 Benchmark]: Toolchain (without parser) took 92029.31 ms. Allocated memory was 144.7 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,387 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:03:39,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.67 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 155.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 151.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,393 INFO L168 Benchmark]: Boogie Preprocessor took 40.65 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,393 INFO L168 Benchmark]: RCFGBuilder took 871.07 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,394 INFO L168 Benchmark]: TraceAbstraction took 90243.10 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.9 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 17:03:39,400 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.24 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.67 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 155.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 151.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.65 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.07 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90243.10 ms. Allocated memory was 201.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.9 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 107 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 5405 VarBasedMoverChecksPositive, 232 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 228 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 79058 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2372 SDtfs, 1847 SDslu, 3923 SDs, 0 SdLazy, 1982 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199613occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 75396 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 113642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...