/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:41:21,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:41:21,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:41:21,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:41:21,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:41:21,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:41:21,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:41:21,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:41:21,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:41:21,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:41:21,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:41:21,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:41:21,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:41:21,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:41:21,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:41:21,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:41:21,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:41:21,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:41:21,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:41:21,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:41:21,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:41:21,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:41:21,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:41:21,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:41:21,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:41:21,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:41:21,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:41:21,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:41:21,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:41:21,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:41:21,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:41:21,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:41:21,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:41:21,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:41:21,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:41:21,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:41:21,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:41:21,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:41:21,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:41:21,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:41:21,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:41:21,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:41:21,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:41:21,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:41:21,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:41:21,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:41:21,894 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:41:21,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:41:21,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:41:21,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:41:21,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:41:21,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:41:21,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:41:21,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:41:21,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:41:21,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:41:21,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:41:21,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:41:21,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:41:21,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:41:21,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:41:21,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:41:21,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:41:21,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:21,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:41:21,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:41:21,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:41:21,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:41:21,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:41:21,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:41:21,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:41:21,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:41:22,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:41:22,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:41:22,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:41:22,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:41:22,208 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:41:22,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-26 23:41:22,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff50b1ca/75144072485042abbb3a67a5f86851f8/FLAG7f81d4c4f [2019-12-26 23:41:22,804 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:41:22,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-26 23:41:22,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff50b1ca/75144072485042abbb3a67a5f86851f8/FLAG7f81d4c4f [2019-12-26 23:41:23,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff50b1ca/75144072485042abbb3a67a5f86851f8 [2019-12-26 23:41:23,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:41:23,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:41:23,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:23,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:41:23,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:41:23,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23, skipping insertion in model container [2019-12-26 23:41:23,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:41:23,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:41:23,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:23,698 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:41:23,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:23,864 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:41:23,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23 WrapperNode [2019-12-26 23:41:23,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:23,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:23,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:41:23,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:41:23,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:23,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:41:23,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:41:23,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:41:23,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:41:23,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:41:23,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:41:23,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:41:23,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (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-26 23:41:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:41:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:41:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:41:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:41:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:41:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:41:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:41:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:41:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:41:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:41:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:41:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:41:24,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:41:24,027 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:41:24,827 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:41:24,827 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:41:24,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:24 BoogieIcfgContainer [2019-12-26 23:41:24,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:41:24,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:41:24,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:41:24,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:41:24,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:41:23" (1/3) ... [2019-12-26 23:41:24,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb054d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:24, skipping insertion in model container [2019-12-26 23:41:24,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23" (2/3) ... [2019-12-26 23:41:24,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb054d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:24, skipping insertion in model container [2019-12-26 23:41:24,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:24" (3/3) ... [2019-12-26 23:41:24,837 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2019-12-26 23:41:24,845 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:41:24,846 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:41:24,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:41:24,854 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:41:24,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:24,967 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:41:24,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:41:24,988 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:41:24,988 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:41:24,988 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:41:24,988 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:41:24,989 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:41:24,989 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:41:24,989 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:41:25,008 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:41:25,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:25,113 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:25,114 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:25,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:25,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:25,238 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:25,238 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:25,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:25,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:41:25,268 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:41:30,395 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:41:30,512 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:41:30,541 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-26 23:41:30,542 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:41:30,545 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-26 23:41:46,061 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-26 23:41:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-26 23:41:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:41:46,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:46,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:41:46,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-26 23:41:46,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:46,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407955116] [2019-12-26 23:41:46,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:46,301 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-26 23:41:46,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407955116] [2019-12-26 23:41:46,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:46,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:41:46,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670063884] [2019-12-26 23:41:46,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:46,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:46,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:46,333 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-26 23:41:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:47,806 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-26 23:41:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:47,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:41:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:51,211 INFO L225 Difference]: With dead ends: 104560 [2019-12-26 23:41:51,211 INFO L226 Difference]: Without dead ends: 102376 [2019-12-26 23:41:51,212 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-26 23:41:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-26 23:41:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-26 23:41:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-26 23:42:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-26 23:42:01,932 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-26 23:42:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:01,932 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-26 23:42:01,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-26 23:42:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:42:01,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:01,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:01,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-26 23:42:01,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:01,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574992901] [2019-12-26 23:42:01,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:02,103 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-26 23:42:02,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574992901] [2019-12-26 23:42:02,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:02,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:02,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324640695] [2019-12-26 23:42:02,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:02,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:02,109 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-26 23:42:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:07,564 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-26 23:42:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:07,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:42:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:08,244 INFO L225 Difference]: With dead ends: 164490 [2019-12-26 23:42:08,244 INFO L226 Difference]: Without dead ends: 164441 [2019-12-26 23:42:08,245 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-26 23:42:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-26 23:42:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-26 23:42:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-26 23:42:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-26 23:42:15,649 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-26 23:42:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:15,650 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-26 23:42:15,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-26 23:42:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:15,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:15,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:15,657 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-26 23:42:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697076291] [2019-12-26 23:42:15,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:15,763 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-26 23:42:15,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697076291] [2019-12-26 23:42:15,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:15,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:15,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549848141] [2019-12-26 23:42:15,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:15,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:15,765 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-26 23:42:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:21,994 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-26 23:42:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:21,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:42:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:22,653 INFO L225 Difference]: With dead ends: 211896 [2019-12-26 23:42:22,653 INFO L226 Difference]: Without dead ends: 211833 [2019-12-26 23:42:22,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-26 23:42:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-26 23:42:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-26 23:42:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-26 23:42:40,169 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-26 23:42:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:40,171 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-26 23:42:40,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-26 23:42:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:40,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:40,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:40,175 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-26 23:42:40,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:40,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273207178] [2019-12-26 23:42:40,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:40,215 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-26 23:42:40,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273207178] [2019-12-26 23:42:40,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:40,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:40,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948296605] [2019-12-26 23:42:40,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:40,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:40,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:40,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:40,217 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-26 23:42:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:40,343 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-26 23:42:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:40,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:42:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:40,419 INFO L225 Difference]: With dead ends: 36088 [2019-12-26 23:42:40,419 INFO L226 Difference]: Without dead ends: 36088 [2019-12-26 23:42:40,420 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-26 23:42:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-26 23:42:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-26 23:42:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-26 23:42:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-26 23:42:41,098 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-26 23:42:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:41,098 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-26 23:42:41,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-26 23:42:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:42:41,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:41,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:41,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-26 23:42:41,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:41,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265857994] [2019-12-26 23:42:41,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:41,245 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-26 23:42:41,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265857994] [2019-12-26 23:42:41,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:41,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:41,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785226615] [2019-12-26 23:42:41,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:41,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:41,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:41,248 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-26 23:42:42,708 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 8 [2019-12-26 23:42:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:43,495 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-26 23:42:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:43,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:42:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:43,577 INFO L225 Difference]: With dead ends: 49088 [2019-12-26 23:42:43,577 INFO L226 Difference]: Without dead ends: 49075 [2019-12-26 23:42:43,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:42:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-26 23:42:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-26 23:42:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-26 23:42:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-26 23:42:44,540 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-26 23:42:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:44,540 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-26 23:42:44,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-26 23:42:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:42:44,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:44,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:44,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-26 23:42:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:44,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695456619] [2019-12-26 23:42:44,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:44,632 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-26 23:42:44,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695456619] [2019-12-26 23:42:44,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:44,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:44,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231555082] [2019-12-26 23:42:44,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:44,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:44,637 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-26 23:42:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:44,685 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-26 23:42:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:42:44,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:42:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:44,705 INFO L225 Difference]: With dead ends: 7050 [2019-12-26 23:42:44,706 INFO L226 Difference]: Without dead ends: 7050 [2019-12-26 23:42:44,706 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-26 23:42:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-26 23:42:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-26 23:42:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-26 23:42:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-26 23:42:44,826 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-26 23:42:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:44,826 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-26 23:42:44,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-26 23:42:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:42:44,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:44,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:44,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-26 23:42:44,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:44,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311947130] [2019-12-26 23:42:44,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:44,950 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-26 23:42:44,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311947130] [2019-12-26 23:42:44,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:44,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:42:44,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019078102] [2019-12-26 23:42:44,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:44,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:44,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:44,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:44,952 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-26 23:42:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:44,989 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-26 23:42:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:44,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:42:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:44,996 INFO L225 Difference]: With dead ends: 5023 [2019-12-26 23:42:44,996 INFO L226 Difference]: Without dead ends: 5023 [2019-12-26 23:42:44,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-26 23:42:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-26 23:42:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-26 23:42:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-26 23:42:45,865 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-26 23:42:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:45,866 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-26 23:42:45,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-26 23:42:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:45,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:45,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:45,876 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-26 23:42:45,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:45,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414031411] [2019-12-26 23:42:45,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:45,944 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-26 23:42:45,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414031411] [2019-12-26 23:42:45,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:45,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:45,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869007235] [2019-12-26 23:42:45,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:45,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:45,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:45,947 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:42:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:46,001 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-26 23:42:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:46,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:46,009 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:42:46,009 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:42:46,009 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-26 23:42:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:42:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:42:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:42:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-26 23:42:46,066 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-26 23:42:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:46,066 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-26 23:42:46,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-26 23:42:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:46,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:46,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:46,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-26 23:42:46,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:46,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722393918] [2019-12-26 23:42:46,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,145 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-26 23:42:46,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722393918] [2019-12-26 23:42:46,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:46,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600304075] [2019-12-26 23:42:46,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:46,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:46,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:46,148 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-26 23:42:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:46,194 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-26 23:42:46,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:46,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:46,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:46,201 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:42:46,202 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:42:46,202 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-26 23:42:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:42:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:42:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:42:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-26 23:42:46,258 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-26 23:42:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:46,258 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-26 23:42:46,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-26 23:42:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:46,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:46,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:46,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-26 23:42:46,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:46,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974038221] [2019-12-26 23:42:46,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,368 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-26 23:42:46,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974038221] [2019-12-26 23:42:46,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:46,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831996821] [2019-12-26 23:42:46,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:46,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:46,371 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-26 23:42:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:46,703 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-26 23:42:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:42:46,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:42:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:46,712 INFO L225 Difference]: With dead ends: 7088 [2019-12-26 23:42:46,712 INFO L226 Difference]: Without dead ends: 7088 [2019-12-26 23:42:46,712 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-26 23:42:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-26 23:42:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-26 23:42:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-26 23:42:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-26 23:42:46,794 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-26 23:42:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:46,794 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-26 23:42:46,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-26 23:42:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:46,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:46,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:46,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-26 23:42:46,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:46,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451112420] [2019-12-26 23:42:46,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,899 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-26 23:42:46,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451112420] [2019-12-26 23:42:46,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:46,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380986457] [2019-12-26 23:42:46,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:46,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:46,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:46,902 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-26 23:42:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:47,249 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-26 23:42:47,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:47,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:42:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:47,265 INFO L225 Difference]: With dead ends: 9067 [2019-12-26 23:42:47,266 INFO L226 Difference]: Without dead ends: 9067 [2019-12-26 23:42:47,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-26 23:42:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-26 23:42:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-26 23:42:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-26 23:42:47,419 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-26 23:42:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:47,420 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-26 23:42:47,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-26 23:42:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:47,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:47,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:47,434 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-26 23:42:47,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:47,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027754292] [2019-12-26 23:42:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:47,556 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-26 23:42:47,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027754292] [2019-12-26 23:42:47,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:47,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:42:47,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729314960] [2019-12-26 23:42:47,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:42:47,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:42:47,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:47,558 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-26 23:42:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:48,065 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-26 23:42:48,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:48,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:42:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:48,084 INFO L225 Difference]: With dead ends: 10883 [2019-12-26 23:42:48,085 INFO L226 Difference]: Without dead ends: 10883 [2019-12-26 23:42:48,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:42:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-26 23:42:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-26 23:42:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-26 23:42:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-26 23:42:48,315 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-26 23:42:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:48,316 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-26 23:42:48,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:42:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-26 23:42:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:48,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:48,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:48,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-26 23:42:48,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:48,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848505154] [2019-12-26 23:42:48,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:48,534 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-26 23:42:48,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848505154] [2019-12-26 23:42:48,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:48,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:48,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159263564] [2019-12-26 23:42:48,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:48,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:48,541 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 7 states. [2019-12-26 23:42:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:48,675 INFO L93 Difference]: Finished difference Result 14742 states and 43256 transitions. [2019-12-26 23:42:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:48,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:48,690 INFO L225 Difference]: With dead ends: 14742 [2019-12-26 23:42:48,690 INFO L226 Difference]: Without dead ends: 9029 [2019-12-26 23:42:48,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:42:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9029 states. [2019-12-26 23:42:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9029 to 6766. [2019-12-26 23:42:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6766 states. [2019-12-26 23:42:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6766 states to 6766 states and 19641 transitions. [2019-12-26 23:42:48,801 INFO L78 Accepts]: Start accepts. Automaton has 6766 states and 19641 transitions. Word has length 65 [2019-12-26 23:42:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:48,801 INFO L462 AbstractCegarLoop]: Abstraction has 6766 states and 19641 transitions. [2019-12-26 23:42:48,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6766 states and 19641 transitions. [2019-12-26 23:42:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:48,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:48,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:48,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1622090895, now seen corresponding path program 5 times [2019-12-26 23:42:48,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:48,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819674156] [2019-12-26 23:42:48,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:48,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819674156] [2019-12-26 23:42:48,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:48,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:48,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509189762] [2019-12-26 23:42:48,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:48,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:48,910 INFO L87 Difference]: Start difference. First operand 6766 states and 19641 transitions. Second operand 7 states. [2019-12-26 23:42:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:51,196 INFO L93 Difference]: Finished difference Result 10521 states and 30197 transitions. [2019-12-26 23:42:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:42:51,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:51,210 INFO L225 Difference]: With dead ends: 10521 [2019-12-26 23:42:51,210 INFO L226 Difference]: Without dead ends: 10521 [2019-12-26 23:42:51,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:42:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10521 states. [2019-12-26 23:42:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10521 to 6579. [2019-12-26 23:42:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-26 23:42:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 19079 transitions. [2019-12-26 23:42:51,323 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 19079 transitions. Word has length 65 [2019-12-26 23:42:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:51,324 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 19079 transitions. [2019-12-26 23:42:51,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 19079 transitions. [2019-12-26 23:42:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:51,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:51,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:51,333 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:51,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1304907827, now seen corresponding path program 6 times [2019-12-26 23:42:51,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:51,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610836236] [2019-12-26 23:42:51,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:51,418 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-26 23:42:51,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610836236] [2019-12-26 23:42:51,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:51,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:42:51,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884617643] [2019-12-26 23:42:51,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:42:51,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:42:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:51,421 INFO L87 Difference]: Start difference. First operand 6579 states and 19079 transitions. Second operand 6 states. [2019-12-26 23:42:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:51,966 INFO L93 Difference]: Finished difference Result 9537 states and 27106 transitions. [2019-12-26 23:42:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:42:51,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:42:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:51,979 INFO L225 Difference]: With dead ends: 9537 [2019-12-26 23:42:51,979 INFO L226 Difference]: Without dead ends: 9537 [2019-12-26 23:42:51,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:42:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-26 23:42:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 6860. [2019-12-26 23:42:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-12-26 23:42:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 19878 transitions. [2019-12-26 23:42:52,080 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 19878 transitions. Word has length 65 [2019-12-26 23:42:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:52,081 INFO L462 AbstractCegarLoop]: Abstraction has 6860 states and 19878 transitions. [2019-12-26 23:42:52,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:42:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 19878 transitions. [2019-12-26 23:42:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:52,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:52,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:52,090 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -338304105, now seen corresponding path program 7 times [2019-12-26 23:42:52,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:52,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729422963] [2019-12-26 23:42:52,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:52,194 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-26 23:42:52,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729422963] [2019-12-26 23:42:52,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:52,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:52,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386246947] [2019-12-26 23:42:52,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:52,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:52,197 INFO L87 Difference]: Start difference. First operand 6860 states and 19878 transitions. Second operand 7 states. [2019-12-26 23:42:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:53,319 INFO L93 Difference]: Finished difference Result 10605 states and 30155 transitions. [2019-12-26 23:42:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:42:53,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:53,341 INFO L225 Difference]: With dead ends: 10605 [2019-12-26 23:42:53,341 INFO L226 Difference]: Without dead ends: 10605 [2019-12-26 23:42:53,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:42:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2019-12-26 23:42:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7315. [2019-12-26 23:42:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-12-26 23:42:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 21208 transitions. [2019-12-26 23:42:53,583 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 21208 transitions. Word has length 65 [2019-12-26 23:42:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:53,583 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 21208 transitions. [2019-12-26 23:42:53,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 21208 transitions. [2019-12-26 23:42:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:53,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:53,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:53,599 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:53,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 882387211, now seen corresponding path program 8 times [2019-12-26 23:42:53,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:53,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587842070] [2019-12-26 23:42:53,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:53,775 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-26 23:42:53,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587842070] [2019-12-26 23:42:53,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:53,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:53,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604791601] [2019-12-26 23:42:53,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:53,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:53,779 INFO L87 Difference]: Start difference. First operand 7315 states and 21208 transitions. Second operand 7 states. [2019-12-26 23:42:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:54,604 INFO L93 Difference]: Finished difference Result 11968 states and 34206 transitions. [2019-12-26 23:42:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:42:54,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:54,617 INFO L225 Difference]: With dead ends: 11968 [2019-12-26 23:42:54,617 INFO L226 Difference]: Without dead ends: 11968 [2019-12-26 23:42:54,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:42:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11968 states. [2019-12-26 23:42:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11968 to 6995. [2019-12-26 23:42:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-12-26 23:42:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 20314 transitions. [2019-12-26 23:42:54,735 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 20314 transitions. Word has length 65 [2019-12-26 23:42:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:54,736 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 20314 transitions. [2019-12-26 23:42:54,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 20314 transitions. [2019-12-26 23:42:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:54,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:54,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:54,743 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:54,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash -466619985, now seen corresponding path program 9 times [2019-12-26 23:42:54,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:54,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010304035] [2019-12-26 23:42:54,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:54,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010304035] [2019-12-26 23:42:54,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:54,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:42:54,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425788978] [2019-12-26 23:42:54,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:42:54,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:42:54,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:42:54,979 INFO L87 Difference]: Start difference. First operand 6995 states and 20314 transitions. Second operand 10 states. [2019-12-26 23:42:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:56,372 INFO L93 Difference]: Finished difference Result 11870 states and 33943 transitions. [2019-12-26 23:42:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:42:56,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 23:42:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:56,395 INFO L225 Difference]: With dead ends: 11870 [2019-12-26 23:42:56,396 INFO L226 Difference]: Without dead ends: 11870 [2019-12-26 23:42:56,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:42:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2019-12-26 23:42:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6757. [2019-12-26 23:42:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-12-26 23:42:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 19602 transitions. [2019-12-26 23:42:56,589 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 19602 transitions. Word has length 65 [2019-12-26 23:42:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:56,590 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 19602 transitions. [2019-12-26 23:42:56,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:42:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 19602 transitions. [2019-12-26 23:42:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:56,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:56,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:56,600 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 794564457, now seen corresponding path program 10 times [2019-12-26 23:42:56,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:56,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77028157] [2019-12-26 23:42:56,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:56,716 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-26 23:42:56,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77028157] [2019-12-26 23:42:56,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:56,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:56,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41203425] [2019-12-26 23:42:56,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:56,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:56,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:56,719 INFO L87 Difference]: Start difference. First operand 6757 states and 19602 transitions. Second operand 7 states. [2019-12-26 23:42:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:57,272 INFO L93 Difference]: Finished difference Result 11247 states and 32123 transitions. [2019-12-26 23:42:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:42:57,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:57,287 INFO L225 Difference]: With dead ends: 11247 [2019-12-26 23:42:57,287 INFO L226 Difference]: Without dead ends: 11247 [2019-12-26 23:42:57,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:42:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11247 states. [2019-12-26 23:42:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11247 to 6841. [2019-12-26 23:42:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-12-26 23:42:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 19803 transitions. [2019-12-26 23:42:57,404 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 19803 transitions. Word has length 65 [2019-12-26 23:42:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:57,404 INFO L462 AbstractCegarLoop]: Abstraction has 6841 states and 19803 transitions. [2019-12-26 23:42:57,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 19803 transitions. [2019-12-26 23:42:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:57,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:57,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:57,412 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1278916147, now seen corresponding path program 11 times [2019-12-26 23:42:57,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:57,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790019301] [2019-12-26 23:42:57,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:57,520 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-26 23:42:57,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790019301] [2019-12-26 23:42:57,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:57,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:42:57,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969854404] [2019-12-26 23:42:57,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:42:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:42:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:42:57,522 INFO L87 Difference]: Start difference. First operand 6841 states and 19803 transitions. Second operand 8 states. [2019-12-26 23:42:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:58,663 INFO L93 Difference]: Finished difference Result 11902 states and 33986 transitions. [2019-12-26 23:42:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:42:58,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 23:42:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:58,679 INFO L225 Difference]: With dead ends: 11902 [2019-12-26 23:42:58,680 INFO L226 Difference]: Without dead ends: 11902 [2019-12-26 23:42:58,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:42:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-12-26 23:42:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6141. [2019-12-26 23:42:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2019-12-26 23:42:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 17820 transitions. [2019-12-26 23:42:58,793 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 17820 transitions. Word has length 65 [2019-12-26 23:42:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:58,793 INFO L462 AbstractCegarLoop]: Abstraction has 6141 states and 17820 transitions. [2019-12-26 23:42:58,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:42:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 17820 transitions. [2019-12-26 23:42:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:58,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:58,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:58,801 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 662541241, now seen corresponding path program 1 times [2019-12-26 23:42:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:58,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504736488] [2019-12-26 23:42:58,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:58,866 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-26 23:42:58,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504736488] [2019-12-26 23:42:58,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:58,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:58,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242099188] [2019-12-26 23:42:58,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:58,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:58,868 INFO L87 Difference]: Start difference. First operand 6141 states and 17820 transitions. Second operand 3 states. [2019-12-26 23:42:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:58,908 INFO L93 Difference]: Finished difference Result 5777 states and 16412 transitions. [2019-12-26 23:42:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:58,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:42:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:58,916 INFO L225 Difference]: With dead ends: 5777 [2019-12-26 23:42:58,917 INFO L226 Difference]: Without dead ends: 5777 [2019-12-26 23:42:58,917 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-26 23:42:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-26 23:42:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 5777. [2019-12-26 23:42:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5777 states. [2019-12-26 23:42:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 16412 transitions. [2019-12-26 23:42:59,009 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 16412 transitions. Word has length 66 [2019-12-26 23:42:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:59,010 INFO L462 AbstractCegarLoop]: Abstraction has 5777 states and 16412 transitions. [2019-12-26 23:42:59,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 16412 transitions. [2019-12-26 23:42:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:59,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:59,018 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1278364733, now seen corresponding path program 1 times [2019-12-26 23:42:59,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:59,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032996155] [2019-12-26 23:42:59,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,074 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-26 23:42:59,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032996155] [2019-12-26 23:42:59,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:59,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77985274] [2019-12-26 23:42:59,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:59,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,076 INFO L87 Difference]: Start difference. First operand 5777 states and 16412 transitions. Second operand 3 states. [2019-12-26 23:42:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:59,173 INFO L93 Difference]: Finished difference Result 5777 states and 16411 transitions. [2019-12-26 23:42:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:59,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:42:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:59,182 INFO L225 Difference]: With dead ends: 5777 [2019-12-26 23:42:59,182 INFO L226 Difference]: Without dead ends: 5777 [2019-12-26 23:42:59,183 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-26 23:42:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-26 23:42:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 3708. [2019-12-26 23:42:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3708 states. [2019-12-26 23:42:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 10669 transitions. [2019-12-26 23:42:59,271 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 10669 transitions. Word has length 66 [2019-12-26 23:42:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 3708 states and 10669 transitions. [2019-12-26 23:42:59,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 10669 transitions. [2019-12-26 23:42:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:42:59,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:59,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:59,279 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash 897051641, now seen corresponding path program 1 times [2019-12-26 23:42:59,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:59,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56453530] [2019-12-26 23:42:59,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,378 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-26 23:42:59,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56453530] [2019-12-26 23:42:59,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:59,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764567864] [2019-12-26 23:42:59,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:59,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,387 INFO L87 Difference]: Start difference. First operand 3708 states and 10669 transitions. Second operand 3 states. [2019-12-26 23:42:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:59,420 INFO L93 Difference]: Finished difference Result 3508 states and 9871 transitions. [2019-12-26 23:42:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:59,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:42:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:59,428 INFO L225 Difference]: With dead ends: 3508 [2019-12-26 23:42:59,428 INFO L226 Difference]: Without dead ends: 3508 [2019-12-26 23:42:59,428 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-26 23:42:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-12-26 23:42:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2815. [2019-12-26 23:42:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-26 23:42:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-26 23:42:59,513 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 67 [2019-12-26 23:42:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:59,513 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-26 23:42:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-26 23:42:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:42:59,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:59,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:59,520 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-26 23:42:59,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:59,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192479531] [2019-12-26 23:42:59,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,940 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-26 23:42:59,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192479531] [2019-12-26 23:42:59,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:42:59,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413481690] [2019-12-26 23:42:59,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:42:59,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:42:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:42:59,944 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 14 states. [2019-12-26 23:43:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:00,850 INFO L93 Difference]: Finished difference Result 6182 states and 17475 transitions. [2019-12-26 23:43:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:43:00,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 23:43:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:00,859 INFO L225 Difference]: With dead ends: 6182 [2019-12-26 23:43:00,860 INFO L226 Difference]: Without dead ends: 6152 [2019-12-26 23:43:00,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:43:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2019-12-26 23:43:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 4326. [2019-12-26 23:43:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-12-26 23:43:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 12163 transitions. [2019-12-26 23:43:00,928 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 12163 transitions. Word has length 68 [2019-12-26 23:43:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:00,928 INFO L462 AbstractCegarLoop]: Abstraction has 4326 states and 12163 transitions. [2019-12-26 23:43:00,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:43:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 12163 transitions. [2019-12-26 23:43:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:00,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:00,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:00,934 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 2 times [2019-12-26 23:43:00,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:00,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375646989] [2019-12-26 23:43:00,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:01,436 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-26 23:43:01,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375646989] [2019-12-26 23:43:01,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:01,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:43:01,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225951805] [2019-12-26 23:43:01,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:43:01,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:43:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:43:01,440 INFO L87 Difference]: Start difference. First operand 4326 states and 12163 transitions. Second operand 19 states. [2019-12-26 23:43:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:04,668 INFO L93 Difference]: Finished difference Result 12483 states and 34669 transitions. [2019-12-26 23:43:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-26 23:43:04,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:43:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:04,682 INFO L225 Difference]: With dead ends: 12483 [2019-12-26 23:43:04,682 INFO L226 Difference]: Without dead ends: 12453 [2019-12-26 23:43:04,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-12-26 23:43:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12453 states. [2019-12-26 23:43:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12453 to 5142. [2019-12-26 23:43:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5142 states. [2019-12-26 23:43:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 14467 transitions. [2019-12-26 23:43:04,778 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 14467 transitions. Word has length 68 [2019-12-26 23:43:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:04,778 INFO L462 AbstractCegarLoop]: Abstraction has 5142 states and 14467 transitions. [2019-12-26 23:43:04,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:43:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 14467 transitions. [2019-12-26 23:43:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:04,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:04,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:04,785 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 3 times [2019-12-26 23:43:04,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:04,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491747171] [2019-12-26 23:43:04,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:05,141 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-26 23:43:05,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491747171] [2019-12-26 23:43:05,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:05,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:43:05,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749540529] [2019-12-26 23:43:05,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:43:05,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:43:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:43:05,144 INFO L87 Difference]: Start difference. First operand 5142 states and 14467 transitions. Second operand 16 states. [2019-12-26 23:43:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:06,410 INFO L93 Difference]: Finished difference Result 8340 states and 23520 transitions. [2019-12-26 23:43:06,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:43:06,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-26 23:43:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:06,422 INFO L225 Difference]: With dead ends: 8340 [2019-12-26 23:43:06,423 INFO L226 Difference]: Without dead ends: 8310 [2019-12-26 23:43:06,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 23:43:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8310 states. [2019-12-26 23:43:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8310 to 4783. [2019-12-26 23:43:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4783 states. [2019-12-26 23:43:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 13397 transitions. [2019-12-26 23:43:06,502 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 13397 transitions. Word has length 68 [2019-12-26 23:43:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:06,502 INFO L462 AbstractCegarLoop]: Abstraction has 4783 states and 13397 transitions. [2019-12-26 23:43:06,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:43:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 13397 transitions. [2019-12-26 23:43:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:06,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:06,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:06,508 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 4 times [2019-12-26 23:43:06,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:06,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267399872] [2019-12-26 23:43:06,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:06,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:43:06,612 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:43:06,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21|) |v_ULTIMATE.start_main_~#t2025~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$r_buff1_thd0~0_308 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2025~0.base_21|) (= v_~z$w_buff1_used~0_516 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21| 1)) (= v_~z$r_buff1_thd1~0_190 0) (= 0 |v_ULTIMATE.start_main_~#t2025~0.offset_17|) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2025~0.base_21| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21|) 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_138, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ULTIMATE.start_main_~#t2025~0.offset=|v_ULTIMATE.start_main_~#t2025~0.offset_17|, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t2025~0.base=|v_ULTIMATE.start_main_~#t2025~0.base_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2026~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2027~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2025~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2025~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-26 23:43:06,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12|) |v_ULTIMATE.start_main_~#t2026~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2026~0.base_12| 4)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2026~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t2026~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2026~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2026~0.offset, #length] because there is no mapped edge [2019-12-26 23:43:06,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:43:06,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2027~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9|) |v_ULTIMATE.start_main_~#t2027~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2027~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t2027~0.offset_8|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_9|, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2027~0.base, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-26 23:43:06,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1551318244 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1551318244 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1551318244 |P0Thread1of1ForFork0_#t~ite5_Out-1551318244|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1551318244| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551318244, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1551318244} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1551318244|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1551318244, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1551318244} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:43:06,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In514262121 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In514262121 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In514262121 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In514262121 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out514262121|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In514262121 |P0Thread1of1ForFork0_#t~ite6_Out514262121|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In514262121, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In514262121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In514262121, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In514262121} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out514262121|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In514262121, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In514262121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In514262121, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In514262121} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:43:06,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1493351869 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1493351869 256)))) (or (and (= ~z$r_buff0_thd1~0_In-1493351869 ~z$r_buff0_thd1~0_Out-1493351869) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1493351869 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1493351869, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1493351869} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1493351869, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1493351869|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1493351869} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:43:06,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1425839957 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1425839957 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1425839957 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1425839957 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1425839957| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1425839957| ~z$r_buff1_thd1~0_In-1425839957)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1425839957, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1425839957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1425839957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1425839957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1425839957, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1425839957|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1425839957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1425839957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1425839957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:43:06,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:43:06,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1071757199 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1071757199 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out1071757199| |P1Thread1of1ForFork1_#t~ite9_Out1071757199|))) (or (and (or .cse0 .cse1) (= ~z~0_In1071757199 |P1Thread1of1ForFork1_#t~ite9_Out1071757199|) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In1071757199 |P1Thread1of1ForFork1_#t~ite9_Out1071757199|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1071757199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1071757199, ~z$w_buff1~0=~z$w_buff1~0_In1071757199, ~z~0=~z~0_In1071757199} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1071757199|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1071757199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1071757199, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1071757199|, ~z$w_buff1~0=~z$w_buff1~0_In1071757199, ~z~0=~z~0_In1071757199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:43:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In462121995 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In462121995 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out462121995| ~z~0_In462121995)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out462121995| ~z$w_buff1~0_In462121995) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In462121995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In462121995, ~z$w_buff1~0=~z$w_buff1~0_In462121995, ~z~0=~z~0_In462121995} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out462121995|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In462121995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In462121995, ~z$w_buff1~0=~z$w_buff1~0_In462121995, ~z~0=~z~0_In462121995} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:43:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:43:06,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In212502689 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In212502689 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In212502689 |P2Thread1of1ForFork2_#t~ite17_Out212502689|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out212502689|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In212502689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In212502689} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In212502689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In212502689, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out212502689|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:43:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-968701028 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-968701028 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-968701028 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-968701028 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-968701028 |P2Thread1of1ForFork2_#t~ite18_Out-968701028|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-968701028|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-968701028, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-968701028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-968701028, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-968701028} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-968701028, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-968701028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-968701028, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-968701028, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-968701028|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:43:06,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2061681109 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In2061681109 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out2061681109| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out2061681109| ~z$r_buff0_thd3~0_In2061681109)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2061681109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2061681109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2061681109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2061681109, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2061681109|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:43:06,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-330044075 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-330044075 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-330044075 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-330044075 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-330044075 |P2Thread1of1ForFork2_#t~ite20_Out-330044075|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out-330044075| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-330044075, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-330044075, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-330044075, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-330044075} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-330044075, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-330044075|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-330044075, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-330044075, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-330044075} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:43:06,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:43:06,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In355433172 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In355433172 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out355433172| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In355433172 |P1Thread1of1ForFork1_#t~ite11_Out355433172|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In355433172, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In355433172} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In355433172, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out355433172|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In355433172} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:43:06,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-318098509 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-318098509 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-318098509 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-318098509 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-318098509|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-318098509 |P1Thread1of1ForFork1_#t~ite12_Out-318098509|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-318098509, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-318098509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-318098509, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-318098509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-318098509, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-318098509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-318098509, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-318098509|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-318098509} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:43:06,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-405138970 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-405138970 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-405138970|)) (and (= ~z$r_buff0_thd2~0_In-405138970 |P1Thread1of1ForFork1_#t~ite13_Out-405138970|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-405138970, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-405138970} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-405138970, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-405138970|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-405138970} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:43:06,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1042964185 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1042964185 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1042964185 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1042964185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1042964185|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1042964185 |P1Thread1of1ForFork1_#t~ite14_Out-1042964185|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042964185, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1042964185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042964185, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1042964185} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042964185, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1042964185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042964185, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1042964185|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1042964185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:43:06,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:43:06,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:43:06,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1382575051 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1382575051 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1382575051| |ULTIMATE.start_main_#t~ite25_Out1382575051|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out1382575051| ~z$w_buff1~0_In1382575051)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1382575051| ~z~0_In1382575051) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382575051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382575051, ~z$w_buff1~0=~z$w_buff1~0_In1382575051, ~z~0=~z~0_In1382575051} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382575051, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1382575051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382575051, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1382575051|, ~z$w_buff1~0=~z$w_buff1~0_In1382575051, ~z~0=~z~0_In1382575051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:43:06,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1039312431 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1039312431 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out1039312431|)) (and (= |ULTIMATE.start_main_#t~ite26_Out1039312431| ~z$w_buff0_used~0_In1039312431) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1039312431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1039312431} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1039312431, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1039312431, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1039312431|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:43:06,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1981925792 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1981925792 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1981925792 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1981925792 256)))) (or (and (= ~z$w_buff1_used~0_In1981925792 |ULTIMATE.start_main_#t~ite27_Out1981925792|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1981925792|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1981925792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1981925792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1981925792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1981925792} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1981925792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1981925792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1981925792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1981925792, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1981925792|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:43:06,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-201591821 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-201591821 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-201591821|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-201591821| ~z$r_buff0_thd0~0_In-201591821)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-201591821, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-201591821} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-201591821, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-201591821|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-201591821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:43:06,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1401758489 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1401758489 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1401758489 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1401758489 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1401758489| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite29_Out-1401758489| ~z$r_buff1_thd0~0_In-1401758489)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1401758489, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401758489, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1401758489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401758489} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1401758489, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1401758489|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401758489, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1401758489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401758489} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:43:06,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:43:06,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:43:06,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:43:06,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:43:06 BasicIcfg [2019-12-26 23:43:06,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:43:06,747 INFO L168 Benchmark]: Toolchain (without parser) took 103639.96 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 725.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,747 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.07 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 152.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.78 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,749 INFO L168 Benchmark]: Boogie Preprocessor took 40.03 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,749 INFO L168 Benchmark]: RCFGBuilder took 857.09 ms. Allocated memory is still 201.3 MB. Free memory was 147.1 MB in the beginning and 97.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,750 INFO L168 Benchmark]: TraceAbstraction took 101913.87 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 665.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:06,752 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 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.07 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 152.6 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.78 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.03 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.09 ms. Allocated memory is still 201.3 MB. Free memory was 147.1 MB in the beginning and 97.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101913.87 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 97.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 665.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.6s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4376 SDtfs, 5089 SDslu, 13346 SDs, 0 SdLazy, 10956 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 89 SyntacticMatches, 30 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 117631 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1343 ConstructedInterpolants, 0 QuantifiedInterpolants, 318563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...