/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/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:51:47,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:51:47,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:51:47,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:51:47,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:51:47,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:51:47,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:51:47,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:51:47,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:51:47,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:51:47,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:51:47,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:51:47,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:51:47,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:51:47,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:51:47,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:51:47,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:51:47,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:51:47,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:51:47,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:51:47,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:51:47,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:51:47,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:51:47,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:51:47,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:51:47,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:51:47,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:51:47,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:51:47,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:51:47,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:51:47,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:51:47,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:51:47,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:51:47,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:51:47,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:51:47,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:51:47,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:51:47,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:51:47,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:51:47,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:51:47,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:51:47,980 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:51:48,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:51:48,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:51:48,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:51:48,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:51:48,011 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:51:48,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:51:48,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:51:48,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:51:48,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:51:48,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:51:48,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:51:48,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:51:48,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:51:48,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:51:48,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:51:48,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:51:48,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:51:48,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:51:48,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:51:48,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:51:48,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:51:48,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:51:48,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:51:48,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:51:48,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:51:48,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:51:48,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:51:48,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:51:48,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:51:48,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:51:48,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:51:48,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:51:48,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:51:48,311 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:51:48,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-18 17:51:48,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e3b97bc/91f85f52360b4db4a10e045275c563c6/FLAGb1212d418 [2019-12-18 17:51:48,918 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:51:48,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-18 17:51:48,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e3b97bc/91f85f52360b4db4a10e045275c563c6/FLAGb1212d418 [2019-12-18 17:51:49,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e3b97bc/91f85f52360b4db4a10e045275c563c6 [2019-12-18 17:51:49,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:51:49,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:51:49,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:51:49,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:51:49,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:51:49,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:51:49" (1/1) ... [2019-12-18 17:51:49,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c74ec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:49, skipping insertion in model container [2019-12-18 17:51:49,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:51:49" (1/1) ... [2019-12-18 17:51:49,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:51:49,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:51:49,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:51:49,889 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:51:49,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:51:50,055 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:51:50,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50 WrapperNode [2019-12-18 17:51:50,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:51:50,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:51:50,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:51:50,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:51:50,064 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:51:50" (1/1) ... [2019-12-18 17:51:50,084 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:51:50" (1/1) ... [2019-12-18 17:51:50,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:51:50,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:51:50,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:51:50,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:51:50,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (1/1) ... [2019-12-18 17:51:50,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:51:50,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:51:50,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:51:50,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:51:50,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (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:51:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:51:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:51:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:51:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:51:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:51:50,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:51:50,236 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:51:50,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:51:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:51:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:51:50,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:51:50,239 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:51:50,937 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:51:50,937 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:51:50,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:51:50 BoogieIcfgContainer [2019-12-18 17:51:50,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:51:50,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:51:50,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:51:50,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:51:50,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:51:49" (1/3) ... [2019-12-18 17:51:50,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a647c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:51:50, skipping insertion in model container [2019-12-18 17:51:50,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:51:50" (2/3) ... [2019-12-18 17:51:50,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a647c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:51:50, skipping insertion in model container [2019-12-18 17:51:50,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:51:50" (3/3) ... [2019-12-18 17:51:50,948 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-12-18 17:51:50,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:51:50,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:51:50,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:51:50,968 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:51:51,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:51:51,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:51:51,073 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:51:51,073 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:51:51,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:51:51,074 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:51:51,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:51:51,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:51:51,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:51:51,074 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:51:51,092 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 17:51:51,094 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 17:51:51,206 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 17:51:51,206 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:51:51,226 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:51:51,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 17:51:51,316 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 17:51:51,316 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:51:51,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 17:51:51,339 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 17:51:51,343 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:51:55,629 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 17:51:55,761 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-18 17:51:55,761 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 17:51:55,765 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 17:51:56,251 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-18 17:51:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-18 17:51:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:51:56,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:56,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:51:56,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-18 17:51:56,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:56,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853685396] [2019-12-18 17:51:56,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:56,541 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:51:56,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853685396] [2019-12-18 17:51:56,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:56,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:51:56,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378574616] [2019-12-18 17:51:56,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:51:56,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:51:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:51:56,570 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-18 17:51:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:56,916 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-18 17:51:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:51:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:51:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:57,039 INFO L225 Difference]: With dead ends: 8377 [2019-12-18 17:51:57,039 INFO L226 Difference]: Without dead ends: 8208 [2019-12-18 17:51:57,041 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:51:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-18 17:51:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-18 17:51:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-18 17:51:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-18 17:51:57,499 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-18 17:51:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:57,500 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-18 17:51:57,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:51:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-18 17:51:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:51:57,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:57,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:51:57,503 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-18 17:51:57,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:57,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048467749] [2019-12-18 17:51:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:57,604 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:51:57,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048467749] [2019-12-18 17:51:57,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:57,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:51:57,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765211848] [2019-12-18 17:51:57,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:51:57,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:57,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:51:57,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:51:57,609 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-18 17:51:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:57,632 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-18 17:51:57,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:51:57,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:51:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:57,642 INFO L225 Difference]: With dead ends: 1326 [2019-12-18 17:51:57,642 INFO L226 Difference]: Without dead ends: 1326 [2019-12-18 17:51:57,643 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:51:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-18 17:51:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-18 17:51:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-18 17:51:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-18 17:51:57,688 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-18 17:51:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:57,689 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-18 17:51:57,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:51:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-18 17:51:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:51:57,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:57,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:51:57,691 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-18 17:51:57,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:57,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553335579] [2019-12-18 17:51:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:57,791 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:51:57,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553335579] [2019-12-18 17:51:57,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:57,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:51:57,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421326426] [2019-12-18 17:51:57,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:51:57,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:51:57,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:51:57,794 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-18 17:51:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:58,108 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-18 17:51:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:51:58,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:51:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:58,124 INFO L225 Difference]: With dead ends: 1806 [2019-12-18 17:51:58,124 INFO L226 Difference]: Without dead ends: 1806 [2019-12-18 17:51:58,125 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:51:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-18 17:51:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-18 17:51:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 17:51:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-18 17:51:58,198 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-18 17:51:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:58,198 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-18 17:51:58,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:51:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-18 17:51:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:51:58,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:58,207 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] [2019-12-18 17:51:58,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-18 17:51:58,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:58,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290325664] [2019-12-18 17:51:58,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:58,346 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:51:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290325664] [2019-12-18 17:51:58,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:58,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:51:58,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997518097] [2019-12-18 17:51:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:51:58,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:51:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:51:58,348 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-18 17:51:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:58,366 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-18 17:51:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:51:58,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 17:51:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:58,369 INFO L225 Difference]: With dead ends: 356 [2019-12-18 17:51:58,369 INFO L226 Difference]: Without dead ends: 356 [2019-12-18 17:51:58,369 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:51:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-18 17:51:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-18 17:51:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-18 17:51:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-18 17:51:58,379 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-18 17:51:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:58,379 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-18 17:51:58,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:51:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-18 17:51:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:51:58,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:58,381 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] [2019-12-18 17:51:58,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-18 17:51:58,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:58,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286993672] [2019-12-18 17:51:58,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:58,482 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:51:58,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286993672] [2019-12-18 17:51:58,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:58,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:51:58,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438067840] [2019-12-18 17:51:58,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:51:58,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:51:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:51:58,486 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-18 17:51:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:58,548 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-18 17:51:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:51:58,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 17:51:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:58,552 INFO L225 Difference]: With dead ends: 331 [2019-12-18 17:51:58,552 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 17:51:58,553 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:51:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 17:51:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-18 17:51:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-18 17:51:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-18 17:51:58,564 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-18 17:51:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:58,569 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-18 17:51:58,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:51:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-18 17:51:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:51:58,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:58,573 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] [2019-12-18 17:51:58,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-18 17:51:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:58,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464718517] [2019-12-18 17:51:58,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:58,746 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:51:58,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464718517] [2019-12-18 17:51:58,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:58,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:51:58,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906008015] [2019-12-18 17:51:58,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:51:58,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:51:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:51:58,751 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-18 17:51:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:58,987 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-18 17:51:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:51:58,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 17:51:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:58,992 INFO L225 Difference]: With dead ends: 458 [2019-12-18 17:51:58,992 INFO L226 Difference]: Without dead ends: 458 [2019-12-18 17:51:58,992 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:51:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-18 17:51:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-18 17:51:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-18 17:51:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-18 17:51:59,003 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-18 17:51:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:59,003 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-18 17:51:59,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:51:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-18 17:51:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:51:59,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:59,005 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] [2019-12-18 17:51:59,005 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-18 17:51:59,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:59,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163015141] [2019-12-18 17:51:59,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:59,193 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:51:59,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163015141] [2019-12-18 17:51:59,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:59,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:51:59,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312636361] [2019-12-18 17:51:59,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:51:59,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:59,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:51:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:51:59,198 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-18 17:51:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:51:59,515 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-18 17:51:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:51:59,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 17:51:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:51:59,520 INFO L225 Difference]: With dead ends: 513 [2019-12-18 17:51:59,520 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 17:51:59,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:51:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 17:51:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-18 17:51:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 17:51:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-18 17:51:59,535 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-18 17:51:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:51:59,535 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-18 17:51:59,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:51:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-18 17:51:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:51:59,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:51:59,538 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] [2019-12-18 17:51:59,538 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:51:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:51:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-18 17:51:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:51:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495352840] [2019-12-18 17:51:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:51:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:51:59,679 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:51:59,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495352840] [2019-12-18 17:51:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:51:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:51:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371179836] [2019-12-18 17:51:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:51:59,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:51:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:51:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:51:59,682 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-18 17:52:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:00,008 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-18 17:52:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:52:00,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 17:52:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:00,013 INFO L225 Difference]: With dead ends: 694 [2019-12-18 17:52:00,013 INFO L226 Difference]: Without dead ends: 694 [2019-12-18 17:52:00,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:52:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-18 17:52:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-18 17:52:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-18 17:52:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-18 17:52:00,060 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-18 17:52:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:00,060 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-18 17:52:00,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:52:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-18 17:52:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 17:52:00,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:00,062 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] [2019-12-18 17:52:00,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-18 17:52:00,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:00,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311371229] [2019-12-18 17:52:00,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:00,115 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:52:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311371229] [2019-12-18 17:52:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:52:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053964280] [2019-12-18 17:52:00,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:52:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:52:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:52:00,117 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-18 17:52:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:00,130 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-18 17:52:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:52:00,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 17:52:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:00,133 INFO L225 Difference]: With dead ends: 406 [2019-12-18 17:52:00,133 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 17:52:00,134 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:52:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 17:52:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-18 17:52:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 17:52:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-18 17:52:00,143 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-18 17:52:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-18 17:52:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:52:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-18 17:52:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 17:52:00,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:00,145 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] [2019-12-18 17:52:00,145 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-18 17:52:00,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:00,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118806149] [2019-12-18 17:52:00,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:00,322 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:52:00,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118806149] [2019-12-18 17:52:00,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:00,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:52:00,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659254914] [2019-12-18 17:52:00,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:52:00,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:52:00,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:52:00,324 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 8 states. [2019-12-18 17:52:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:00,827 INFO L93 Difference]: Finished difference Result 677 states and 1203 transitions. [2019-12-18 17:52:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:52:00,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 17:52:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:00,833 INFO L225 Difference]: With dead ends: 677 [2019-12-18 17:52:00,833 INFO L226 Difference]: Without dead ends: 677 [2019-12-18 17:52:00,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:52:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-18 17:52:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 362. [2019-12-18 17:52:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-18 17:52:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 654 transitions. [2019-12-18 17:52:00,844 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 654 transitions. Word has length 53 [2019-12-18 17:52:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:00,844 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 654 transitions. [2019-12-18 17:52:00,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:52:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 654 transitions. [2019-12-18 17:52:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 17:52:00,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:00,846 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] [2019-12-18 17:52:00,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -162355984, now seen corresponding path program 2 times [2019-12-18 17:52:00,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:00,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052611457] [2019-12-18 17:52:00,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:00,963 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:52:00,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052611457] [2019-12-18 17:52:00,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:00,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:52:00,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385848259] [2019-12-18 17:52:00,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:52:00,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:00,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:52:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:52:00,965 INFO L87 Difference]: Start difference. First operand 362 states and 654 transitions. Second operand 3 states. [2019-12-18 17:52:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:01,004 INFO L93 Difference]: Finished difference Result 362 states and 653 transitions. [2019-12-18 17:52:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:52:01,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 17:52:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:01,008 INFO L225 Difference]: With dead ends: 362 [2019-12-18 17:52:01,008 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 17:52:01,008 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:52:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 17:52:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 275. [2019-12-18 17:52:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-18 17:52:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 491 transitions. [2019-12-18 17:52:01,016 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 491 transitions. Word has length 53 [2019-12-18 17:52:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:01,016 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 491 transitions. [2019-12-18 17:52:01,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:52:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 491 transitions. [2019-12-18 17:52:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:52:01,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:01,018 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] [2019-12-18 17:52:01,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1221221950, now seen corresponding path program 1 times [2019-12-18 17:52:01,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:01,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753335953] [2019-12-18 17:52:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:01,192 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:52:01,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753335953] [2019-12-18 17:52:01,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:01,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:52:01,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835087281] [2019-12-18 17:52:01,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:52:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:52:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:52:01,194 INFO L87 Difference]: Start difference. First operand 275 states and 491 transitions. Second operand 7 states. [2019-12-18 17:52:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:01,304 INFO L93 Difference]: Finished difference Result 479 states and 849 transitions. [2019-12-18 17:52:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:52:01,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 17:52:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:01,307 INFO L225 Difference]: With dead ends: 479 [2019-12-18 17:52:01,307 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 17:52:01,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:52:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 17:52:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2019-12-18 17:52:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 17:52:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 339 transitions. [2019-12-18 17:52:01,328 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 339 transitions. Word has length 54 [2019-12-18 17:52:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:01,328 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 339 transitions. [2019-12-18 17:52:01,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:52:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 339 transitions. [2019-12-18 17:52:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:52:01,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:01,329 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] [2019-12-18 17:52:01,330 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:01,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 2 times [2019-12-18 17:52:01,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:01,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705817984] [2019-12-18 17:52:01,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:01,527 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:52:01,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705817984] [2019-12-18 17:52:01,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:01,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:52:01,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575398093] [2019-12-18 17:52:01,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:52:01,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:01,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:52:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:52:01,531 INFO L87 Difference]: Start difference. First operand 197 states and 339 transitions. Second operand 13 states. [2019-12-18 17:52:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:02,007 INFO L93 Difference]: Finished difference Result 364 states and 617 transitions. [2019-12-18 17:52:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:52:02,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 17:52:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:02,010 INFO L225 Difference]: With dead ends: 364 [2019-12-18 17:52:02,010 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 17:52:02,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:52:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 17:52:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-18 17:52:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-18 17:52:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 510 transitions. [2019-12-18 17:52:02,024 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 510 transitions. Word has length 54 [2019-12-18 17:52:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:02,026 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 510 transitions. [2019-12-18 17:52:02,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:52:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 510 transitions. [2019-12-18 17:52:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:52:02,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:02,027 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] [2019-12-18 17:52:02,028 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 3 times [2019-12-18 17:52:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645278432] [2019-12-18 17:52:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:52:02,320 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:52:02,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645278432] [2019-12-18 17:52:02,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:52:02,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:52:02,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674957535] [2019-12-18 17:52:02,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:52:02,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:52:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:52:02,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:52:02,322 INFO L87 Difference]: Start difference. First operand 297 states and 510 transitions. Second operand 12 states. [2019-12-18 17:52:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:52:02,749 INFO L93 Difference]: Finished difference Result 402 states and 671 transitions. [2019-12-18 17:52:02,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:52:02,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 17:52:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:52:02,753 INFO L225 Difference]: With dead ends: 402 [2019-12-18 17:52:02,753 INFO L226 Difference]: Without dead ends: 367 [2019-12-18 17:52:02,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:52:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-18 17:52:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-18 17:52:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 17:52:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 524 transitions. [2019-12-18 17:52:02,764 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 524 transitions. Word has length 54 [2019-12-18 17:52:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:52:02,764 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 524 transitions. [2019-12-18 17:52:02,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:52:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 524 transitions. [2019-12-18 17:52:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 17:52:02,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:52:02,768 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] [2019-12-18 17:52:02,768 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:52:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:52:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 4 times [2019-12-18 17:52:02,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:52:02,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118015955] [2019-12-18 17:52:02,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:52:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:52:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:52:02,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:52:02,916 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:52:02,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1447~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22| 1) |v_#valid_47|) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_17|, ~x~0=v_~x~0_144, ULTIMATE.start_main_~#t1447~0.offset=|v_ULTIMATE.start_main_~#t1447~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ULTIMATE.start_main_~#t1447~0.base=|v_ULTIMATE.start_main_~#t1447~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1448~0.offset, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~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~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1448~0.base, ~x~0, ULTIMATE.start_main_~#t1447~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_~#t1447~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, 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, #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_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:52:02,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1448~0.base_10| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1448~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1448~0.offset_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10|) |v_ULTIMATE.start_main_~#t1448~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1448~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1448~0.base] because there is no mapped edge [2019-12-18 17:52:02,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} 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:52:02,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out356984770| |P0Thread1of1ForFork0_#t~ite4_Out356984770|)) (.cse2 (= (mod ~x$w_buff1_used~0_In356984770 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In356984770 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out356984770| ~x~0_In356984770)) (and .cse0 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out356984770| ~x$w_buff1~0_In356984770) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In356984770, ~x$w_buff1_used~0=~x$w_buff1_used~0_In356984770, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In356984770, ~x~0=~x~0_In356984770} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out356984770|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out356984770|, ~x$w_buff1~0=~x$w_buff1~0_In356984770, ~x$w_buff1_used~0=~x$w_buff1_used~0_In356984770, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In356984770, ~x~0=~x~0_In356984770} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:52:02,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1468105093 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1468105093 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1468105093|)) (and (= ~x$w_buff0_used~0_In1468105093 |P0Thread1of1ForFork0_#t~ite5_Out1468105093|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1468105093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468105093} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1468105093|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1468105093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468105093} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:52:02,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-441541708 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-441541708 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-441541708 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-441541708 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-441541708| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-441541708| ~x$w_buff1_used~0_In-441541708) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-441541708, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-441541708, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-441541708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-441541708} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-441541708|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-441541708, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-441541708, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-441541708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-441541708} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:52:02,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In268928344 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In268928344 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In268928344 |P1Thread1of1ForFork1_#t~ite11_Out268928344|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out268928344|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In268928344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In268928344} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out268928344|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In268928344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In268928344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:52:02,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In708272154 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In708272154 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out708272154| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out708272154| ~x$r_buff0_thd1~0_In708272154)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In708272154, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708272154} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In708272154, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out708272154|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708272154} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:52:02,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In129620842 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In129620842 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In129620842 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In129620842 256)))) (or (and (= ~x$r_buff1_thd1~0_In129620842 |P0Thread1of1ForFork0_#t~ite8_Out129620842|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out129620842|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In129620842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129620842, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In129620842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In129620842} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In129620842, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out129620842|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129620842, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In129620842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In129620842} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:52:02,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} 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:52:02,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-430309712 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-430309712 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-430309712 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-430309712 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-430309712|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-430309712 |P1Thread1of1ForFork1_#t~ite12_Out-430309712|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-430309712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-430309712, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430309712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430309712} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-430309712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-430309712, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-430309712|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-430309712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-430309712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:52:02,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1815517388 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1815517388 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1815517388 ~x$r_buff0_thd2~0_Out-1815517388)) (and (= 0 ~x$r_buff0_thd2~0_Out-1815517388) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1815517388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815517388} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1815517388|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1815517388, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815517388} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:52:02,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1988182774 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1988182774 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1988182774 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1988182774 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1988182774|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1988182774| ~x$r_buff1_thd2~0_In1988182774) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1988182774, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1988182774, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1988182774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988182774} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1988182774, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1988182774, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1988182774, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1988182774|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988182774} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:52:02,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, 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:52:02,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:52:02,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite17_Out1409295677| |ULTIMATE.start_main_#t~ite18_Out1409295677|)) (.cse1 (= (mod ~x$w_buff1_used~0_In1409295677 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1409295677 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out1409295677| ~x~0_In1409295677) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite17_Out1409295677| ~x$w_buff1~0_In1409295677)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1409295677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1409295677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1409295677, ~x~0=~x~0_In1409295677} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1409295677|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1409295677|, ~x$w_buff1~0=~x$w_buff1~0_In1409295677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1409295677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1409295677, ~x~0=~x~0_In1409295677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 17:52:02,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In990057721 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In990057721 256)))) (or (and (= ~x$w_buff0_used~0_In990057721 |ULTIMATE.start_main_#t~ite19_Out990057721|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out990057721| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In990057721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990057721} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In990057721, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out990057721|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In990057721} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:52:02,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1629907625 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1629907625 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1629907625 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1629907625 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1629907625|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1629907625 |ULTIMATE.start_main_#t~ite20_Out-1629907625|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1629907625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1629907625, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1629907625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1629907625} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1629907625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1629907625, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1629907625|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1629907625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1629907625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:52:02,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2144288618 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2144288618 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-2144288618|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-2144288618 |ULTIMATE.start_main_#t~ite21_Out-2144288618|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144288618, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144288618} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2144288618, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2144288618|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144288618} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:52:02,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1791533193 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1791533193 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1791533193 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1791533193 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1791533193| ~x$r_buff1_thd0~0_In1791533193) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out1791533193| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1791533193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1791533193, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1791533193, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791533193} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1791533193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1791533193, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1791533193, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1791533193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791533193} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:52:02,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2069093429 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out2069093429| |ULTIMATE.start_main_#t~ite31_Out2069093429|) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In2069093429 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In2069093429 256)) .cse0) (and (= (mod ~x$r_buff1_thd0~0_In2069093429 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In2069093429 256)))) .cse1 (= ~x$w_buff1~0_In2069093429 |ULTIMATE.start_main_#t~ite31_Out2069093429|)) (and (= |ULTIMATE.start_main_#t~ite31_In2069093429| |ULTIMATE.start_main_#t~ite31_Out2069093429|) (= |ULTIMATE.start_main_#t~ite32_Out2069093429| ~x$w_buff1~0_In2069093429) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2069093429, ~x$w_buff1~0=~x$w_buff1~0_In2069093429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2069093429, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2069093429, ~weak$$choice2~0=~weak$$choice2~0_In2069093429, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In2069093429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2069093429} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2069093429, ~x$w_buff1~0=~x$w_buff1~0_In2069093429, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2069093429, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out2069093429|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2069093429, ~weak$$choice2~0=~weak$$choice2~0_In2069093429, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out2069093429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2069093429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 17:52:02,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:52:02,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:52:02,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) 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_10, 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:52:03,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:52:03 BasicIcfg [2019-12-18 17:52:03,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:52:03,007 INFO L168 Benchmark]: Toolchain (without parser) took 13774.17 ms. Allocated memory was 137.4 MB in the beginning and 386.9 MB in the end (delta: 249.6 MB). Free memory was 100.7 MB in the beginning and 149.8 MB in the end (delta: -49.1 MB). Peak memory consumption was 200.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,008 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.71 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,010 INFO L168 Benchmark]: Boogie Preprocessor took 52.00 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,010 INFO L168 Benchmark]: RCFGBuilder took 765.36 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 107.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,011 INFO L168 Benchmark]: TraceAbstraction took 12065.46 ms. Allocated memory was 201.9 MB in the beginning and 386.9 MB in the end (delta: 185.1 MB). Free memory was 106.5 MB in the beginning and 149.8 MB in the end (delta: -43.3 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:52:03,015 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.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.71 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 156.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.00 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.36 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 107.2 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12065.46 ms. Allocated memory was 201.9 MB in the beginning and 386.9 MB in the end (delta: 185.1 MB). Free memory was 106.5 MB in the beginning and 149.8 MB in the end (delta: -43.3 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 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_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 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) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 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 [L756] 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) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 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 [L787] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 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) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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) [L799] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 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)) [L800] 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)) [L801] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 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)) [L802] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 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)) [L804] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 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)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1376 SDtfs, 1170 SDslu, 3202 SDs, 0 SdLazy, 1846 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 14 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1153 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 96063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...