/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/podwr001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:02:34,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:02:34,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:02:34,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:02:34,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:02:34,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:02:34,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:02:34,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:02:34,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:02:34,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:02:34,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:02:34,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:02:34,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:02:34,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:02:34,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:02:34,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:02:34,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:02:34,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:02:34,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:02:34,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:02:34,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:02:34,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:02:34,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:02:34,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:02:34,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:02:34,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:02:34,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:02:34,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:02:34,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:02:34,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:02:34,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:02:34,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:02:34,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:02:34,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:02:34,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:02:34,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:02:34,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:02:34,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:02:34,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:02:34,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:02:34,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:02:34,927 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-18 14:02:34,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:02:34,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:02:34,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:02:34,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:02:34,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:02:34,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:02:34,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:02:34,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:02:34,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:02:34,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:02:34,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:02:34,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:02:34,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:02:34,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:02:34,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:02:34,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:02:34,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:02:34,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:02:34,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:02:34,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:02:35,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:02:35,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:02:35,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:02:35,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:02:35,242 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:02:35,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-18 14:02:35,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8009f8/cf77c4cf0df745c686846a0db2f5f540/FLAG1f0c27c0e [2019-12-18 14:02:35,802 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:02:35,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_power.opt.i [2019-12-18 14:02:35,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8009f8/cf77c4cf0df745c686846a0db2f5f540/FLAG1f0c27c0e [2019-12-18 14:02:36,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8009f8/cf77c4cf0df745c686846a0db2f5f540 [2019-12-18 14:02:36,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:02:36,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:02:36,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:02:36,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:02:36,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:02:36,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b22db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36, skipping insertion in model container [2019-12-18 14:02:36,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:02:36,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:02:36,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:02:36,715 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:02:36,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:02:36,860 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:02:36,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36 WrapperNode [2019-12-18 14:02:36,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:02:36,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:02:36,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:02:36,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:02:36,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:02:36,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:02:36,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:02:36,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:02:36,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... [2019-12-18 14:02:36,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:02:36,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:02:36,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:02:36,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:02:36,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:02:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:02:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:02:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:02:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:02:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:02:37,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:02:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:02:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:02:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:02:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:02:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:02:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:02:37,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:02:37,038 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:02:37,834 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:02:37,834 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:02:37,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:02:37 BoogieIcfgContainer [2019-12-18 14:02:37,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:02:37,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:02:37,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:02:37,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:02:37,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:02:36" (1/3) ... [2019-12-18 14:02:37,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:02:37, skipping insertion in model container [2019-12-18 14:02:37,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:36" (2/3) ... [2019-12-18 14:02:37,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:02:37, skipping insertion in model container [2019-12-18 14:02:37,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:02:37" (3/3) ... [2019-12-18 14:02:37,844 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.opt.i [2019-12-18 14:02:37,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:02:37,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:02:37,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:02:37,868 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:02:37,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,952 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:37,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:38,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:02:38,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:02:38,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:02:38,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:02:38,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:02:38,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:02:38,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:02:38,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:02:38,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:02:38,063 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 14:02:38,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 14:02:38,156 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 14:02:38,156 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:02:38,177 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:02:38,205 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 14:02:38,256 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 14:02:38,257 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:02:38,267 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:02:38,289 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 14:02:38,290 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:02:43,472 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:02:43,603 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:02:43,956 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 14:02:43,957 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 14:02:43,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 14:03:08,428 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 14:03:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 14:03:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:03:08,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:08,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:03:08,435 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-18 14:03:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 14:03:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:08,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809144507] [2019-12-18 14:03:08,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:08,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809144507] [2019-12-18 14:03:08,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:08,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:03:08,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804937855] [2019-12-18 14:03:08,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:08,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:08,653 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 14:03:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:12,351 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 14:03:12,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:12,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:03:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:13,004 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 14:03:13,005 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 14:03:13,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 14:03:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 14:03:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 14:03:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 14:03:22,695 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 14:03:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:22,696 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 14:03:22,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 14:03:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:03:22,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:22,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:22,700 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-18 14:03:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 14:03:22,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:22,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714046380] [2019-12-18 14:03:22,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:22,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714046380] [2019-12-18 14:03:22,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:22,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:22,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307590739] [2019-12-18 14:03:22,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:03:22,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:03:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:22,852 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 14:03:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:28,015 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 14:03:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:03:28,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:03:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:28,795 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 14:03:28,795 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 14:03:28,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:03:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 14:03:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 14:03:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 14:03:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 14:03:46,458 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 14:03:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:46,459 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 14:03:46,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:03:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 14:03:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:03:46,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:46,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:46,467 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-18 14:03:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 14:03:46,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:46,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238731694] [2019-12-18 14:03:46,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:46,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238731694] [2019-12-18 14:03:46,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:46,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:46,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338201449] [2019-12-18 14:03:46,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:46,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:46,543 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 14:03:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:46,695 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 14:03:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:46,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:03:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:46,755 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 14:03:46,756 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 14:03:46,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 14:03:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 14:03:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 14:03:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 14:03:47,473 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 14:03:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:47,474 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 14:03:47,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 14:03:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:03:47,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:47,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:47,477 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-18 14:03:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 14:03:47,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:47,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902808908] [2019-12-18 14:03:47,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:47,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902808908] [2019-12-18 14:03:47,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:47,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:47,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116468577] [2019-12-18 14:03:47,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:47,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:47,542 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 14:03:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:47,747 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 14:03:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:47,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:03:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:47,848 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 14:03:47,848 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 14:03:47,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 14:03:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 14:03:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 14:03:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 14:03:50,185 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 14:03:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:50,186 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 14:03:50,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 14:03:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:03:50,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:50,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:50,189 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-18 14:03:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 14:03:50,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:50,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170629964] [2019-12-18 14:03:50,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:50,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170629964] [2019-12-18 14:03:50,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:50,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:50,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804086665] [2019-12-18 14:03:50,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:03:50,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:50,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:03:50,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:03:50,279 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 14:03:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:50,834 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 14:03:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:03:50,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:03:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:50,920 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 14:03:50,920 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 14:03:50,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 14:03:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 14:03:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 14:03:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 14:03:52,848 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 14:03:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:52,848 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 14:03:52,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:03:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 14:03:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:03:52,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:52,862 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] [2019-12-18 14:03:52,863 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-18 14:03:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 14:03:52,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:52,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098498011] [2019-12-18 14:03:52,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:52,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098498011] [2019-12-18 14:03:52,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:52,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:03:52,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670848264] [2019-12-18 14:03:52,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:03:52,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:03:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:03:52,997 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 14:03:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:54,056 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 14:03:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:03:54,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:03:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:54,183 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 14:03:54,183 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 14:03:54,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:03:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 14:03:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 14:03:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 14:03:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 14:03:55,170 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 14:03:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:55,171 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 14:03:55,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:03:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 14:03:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:03:55,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:55,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:55,189 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-18 14:03:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 14:03:55,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:55,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85871172] [2019-12-18 14:03:55,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:55,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85871172] [2019-12-18 14:03:55,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:55,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:55,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698256656] [2019-12-18 14:03:55,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:03:55,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:03:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:55,239 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 14:03:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:57,399 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 14:03:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:03:57,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:03:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:57,434 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 14:03:57,434 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 14:03:57,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 14:03:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 14:03:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 14:03:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 14:03:57,714 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 14:03:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:57,714 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 14:03:57,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:03:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 14:03:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:03:57,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:57,728 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] [2019-12-18 14:03:57,728 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-18 14:03:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 14:03:57,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:57,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369893161] [2019-12-18 14:03:57,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:57,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369893161] [2019-12-18 14:03:57,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:57,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:03:57,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874420797] [2019-12-18 14:03:57,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:03:57,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:03:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:03:57,836 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 14:03:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:58,452 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 14:03:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:03:58,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 14:03:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:58,498 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 14:03:58,498 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 14:03:58,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:03:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 14:03:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 14:03:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 14:03:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 14:03:58,879 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 14:03:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:58,879 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 14:03:58,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:03:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 14:03:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:03:58,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:58,903 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] [2019-12-18 14:03:58,903 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-18 14:03:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 14:03:58,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:58,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349859740] [2019-12-18 14:03:58,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:59,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349859740] [2019-12-18 14:03:59,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:59,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:03:59,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620415130] [2019-12-18 14:03:59,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:03:59,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:03:59,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:59,017 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 14:04:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:00,193 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 14:04:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:04:00,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:04:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:00,235 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 14:04:00,235 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 14:04:00,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:04:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 14:04:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 14:04:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 14:04:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 14:04:00,748 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 14:04:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:00,749 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 14:04:00,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:04:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 14:04:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:04:00,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:00,776 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] [2019-12-18 14:04:00,776 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-18 14:04:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 14:04:00,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737528004] [2019-12-18 14:04:00,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:00,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737528004] [2019-12-18 14:04:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:00,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:04:00,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592849838] [2019-12-18 14:04:00,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:04:00,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:04:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:04:00,854 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 14:04:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:00,954 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-18 14:04:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:04:00,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 14:04:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:00,991 INFO L225 Difference]: With dead ends: 18279 [2019-12-18 14:04:00,991 INFO L226 Difference]: Without dead ends: 18279 [2019-12-18 14:04:00,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:04:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-18 14:04:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-18 14:04:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 14:04:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-18 14:04:01,373 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-18 14:04:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:01,373 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-18 14:04:01,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:04:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-18 14:04:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:04:01,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:01,396 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] [2019-12-18 14:04:01,396 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-18 14:04:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-18 14:04:01,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:01,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172226775] [2019-12-18 14:04:01,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:01,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172226775] [2019-12-18 14:04:01,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:01,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:04:01,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923709680] [2019-12-18 14:04:01,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:04:01,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:04:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:04:01,531 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-18 14:04:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:02,176 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-18 14:04:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:04:02,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:04:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:02,258 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 14:04:02,258 INFO L226 Difference]: Without dead ends: 38006 [2019-12-18 14:04:02,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:04:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-18 14:04:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-18 14:04:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-18 14:04:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-18 14:04:02,976 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-18 14:04:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:02,976 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-18 14:04:02,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:04:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-18 14:04:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:04:03,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:03,001 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] [2019-12-18 14:04:03,001 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-18 14:04:03,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-18 14:04:03,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:03,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589497374] [2019-12-18 14:04:03,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:03,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589497374] [2019-12-18 14:04:03,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:03,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:04:03,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022764648] [2019-12-18 14:04:03,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:04:03,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:03,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:04:03,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:04:03,114 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-18 14:04:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:03,657 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-18 14:04:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:04:03,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:04:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:03,719 INFO L225 Difference]: With dead ends: 57554 [2019-12-18 14:04:03,719 INFO L226 Difference]: Without dead ends: 41745 [2019-12-18 14:04:03,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:04:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-18 14:04:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-18 14:04:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-18 14:04:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-18 14:04:04,295 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-18 14:04:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:04,295 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-18 14:04:04,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:04:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-18 14:04:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:04:04,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:04,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:04,329 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-18 14:04:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-18 14:04:04,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:04,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553375257] [2019-12-18 14:04:04,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:04,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553375257] [2019-12-18 14:04:04,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:04,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:04:04,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958844599] [2019-12-18 14:04:04,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:04:04,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:04,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:04:04,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:04:04,425 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-18 14:04:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:04,889 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-18 14:04:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:04:04,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:04:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:04,957 INFO L225 Difference]: With dead ends: 51247 [2019-12-18 14:04:04,958 INFO L226 Difference]: Without dead ends: 47407 [2019-12-18 14:04:04,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:04:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-18 14:04:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-18 14:04:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-18 14:04:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-18 14:04:05,757 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-18 14:04:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:05,757 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-18 14:04:05,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:04:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-18 14:04:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:04:05,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:05,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:05,803 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-18 14:04:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 14:04:05,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:05,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337509928] [2019-12-18 14:04:05,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:05,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337509928] [2019-12-18 14:04:05,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:05,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:04:05,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459188936] [2019-12-18 14:04:05,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:04:05,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:04:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:04:05,893 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-18 14:04:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:05,994 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-18 14:04:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:04:05,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:04:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:06,036 INFO L225 Difference]: With dead ends: 20919 [2019-12-18 14:04:06,036 INFO L226 Difference]: Without dead ends: 20919 [2019-12-18 14:04:06,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:04:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-18 14:04:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-18 14:04:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-18 14:04:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-18 14:04:06,582 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-18 14:04:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:06,582 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-18 14:04:06,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:04:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-18 14:04:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:04:06,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:06,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:06,616 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-18 14:04:06,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 14:04:06,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:06,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569975749] [2019-12-18 14:04:06,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:06,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569975749] [2019-12-18 14:04:06,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:06,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:04:06,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486714457] [2019-12-18 14:04:06,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:04:06,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:04:06,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:04:06,687 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-18 14:04:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:06,824 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-18 14:04:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:04:06,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:04:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:06,865 INFO L225 Difference]: With dead ends: 24197 [2019-12-18 14:04:06,865 INFO L226 Difference]: Without dead ends: 24197 [2019-12-18 14:04:06,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:04:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-18 14:04:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-18 14:04:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-18 14:04:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-18 14:04:07,400 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-18 14:04:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:07,400 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-18 14:04:07,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:04:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-18 14:04:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:07,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:07,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:07,425 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-18 14:04:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 14:04:07,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:07,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593195621] [2019-12-18 14:04:07,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:07,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593195621] [2019-12-18 14:04:07,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:07,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:04:07,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067524886] [2019-12-18 14:04:07,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:04:07,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:04:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:04:07,500 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-18 14:04:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:07,706 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-18 14:04:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:04:07,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 14:04:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:07,769 INFO L225 Difference]: With dead ends: 24621 [2019-12-18 14:04:07,769 INFO L226 Difference]: Without dead ends: 24621 [2019-12-18 14:04:07,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:04:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-18 14:04:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-18 14:04:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-18 14:04:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-18 14:04:08,461 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-18 14:04:08,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:08,462 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-18 14:04:08,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:04:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-18 14:04:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:08,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:08,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:08,496 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-18 14:04:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 14:04:08,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:08,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770249276] [2019-12-18 14:04:08,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:08,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770249276] [2019-12-18 14:04:08,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:08,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:04:08,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44277897] [2019-12-18 14:04:08,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:04:08,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:04:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:04:08,673 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-18 14:04:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:10,840 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-18 14:04:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:04:10,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 14:04:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:10,912 INFO L225 Difference]: With dead ends: 38488 [2019-12-18 14:04:10,913 INFO L226 Difference]: Without dead ends: 30672 [2019-12-18 14:04:10,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:04:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-18 14:04:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-18 14:04:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-18 14:04:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-18 14:04:11,648 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-18 14:04:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:11,648 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-18 14:04:11,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:04:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-18 14:04:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:11,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:11,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:11,673 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-18 14:04:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-18 14:04:11,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:11,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414438391] [2019-12-18 14:04:11,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:11,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414438391] [2019-12-18 14:04:11,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:11,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:04:11,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636903078] [2019-12-18 14:04:11,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:04:11,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:04:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:04:11,877 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-18 14:04:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:13,538 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-18 14:04:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:04:13,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 14:04:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:13,585 INFO L225 Difference]: With dead ends: 37884 [2019-12-18 14:04:13,585 INFO L226 Difference]: Without dead ends: 31924 [2019-12-18 14:04:13,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:04:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-18 14:04:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-18 14:04:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-18 14:04:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-18 14:04:14,008 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-18 14:04:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:14,009 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-18 14:04:14,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:04:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-18 14:04:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:14,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:14,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:14,029 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-18 14:04:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-18 14:04:14,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:14,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283801643] [2019-12-18 14:04:14,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:14,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283801643] [2019-12-18 14:04:14,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:14,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:14,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827097358] [2019-12-18 14:04:14,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:14,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:14,190 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-18 14:04:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:16,144 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-18 14:04:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:04:16,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:16,187 INFO L225 Difference]: With dead ends: 34983 [2019-12-18 14:04:16,187 INFO L226 Difference]: Without dead ends: 31500 [2019-12-18 14:04:16,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:04:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-18 14:04:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-18 14:04:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-18 14:04:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-18 14:04:16,610 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-18 14:04:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:16,610 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-18 14:04:16,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-18 14:04:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:16,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:16,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:16,634 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-18 14:04:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-18 14:04:16,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:16,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459348469] [2019-12-18 14:04:16,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:16,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459348469] [2019-12-18 14:04:16,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:16,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:16,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873284139] [2019-12-18 14:04:16,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:16,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:16,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:16,911 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 11 states. [2019-12-18 14:04:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:18,788 INFO L93 Difference]: Finished difference Result 35662 states and 109099 transitions. [2019-12-18 14:04:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:04:18,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:18,832 INFO L225 Difference]: With dead ends: 35662 [2019-12-18 14:04:18,833 INFO L226 Difference]: Without dead ends: 31290 [2019-12-18 14:04:18,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:04:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31290 states. [2019-12-18 14:04:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31290 to 21989. [2019-12-18 14:04:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-18 14:04:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-18 14:04:19,267 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-18 14:04:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:19,268 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-18 14:04:19,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-18 14:04:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:19,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:19,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:19,294 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-18 14:04:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-18 14:04:19,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:19,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008230722] [2019-12-18 14:04:19,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:19,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008230722] [2019-12-18 14:04:19,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:19,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:04:19,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427388894] [2019-12-18 14:04:19,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:04:19,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:04:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:04:19,751 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 13 states. [2019-12-18 14:04:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:24,872 INFO L93 Difference]: Finished difference Result 41107 states and 123030 transitions. [2019-12-18 14:04:24,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 14:04:24,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 14:04:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:24,928 INFO L225 Difference]: With dead ends: 41107 [2019-12-18 14:04:24,928 INFO L226 Difference]: Without dead ends: 40843 [2019-12-18 14:04:24,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=462, Invalid=2190, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 14:04:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-18 14:04:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 30143. [2019-12-18 14:04:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30143 states. [2019-12-18 14:04:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30143 states to 30143 states and 91862 transitions. [2019-12-18 14:04:25,529 INFO L78 Accepts]: Start accepts. Automaton has 30143 states and 91862 transitions. Word has length 66 [2019-12-18 14:04:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:25,530 INFO L462 AbstractCegarLoop]: Abstraction has 30143 states and 91862 transitions. [2019-12-18 14:04:25,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:04:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30143 states and 91862 transitions. [2019-12-18 14:04:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:25,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:25,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:25,573 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-18 14:04:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash 350220362, now seen corresponding path program 6 times [2019-12-18 14:04:25,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:25,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438910460] [2019-12-18 14:04:25,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438910460] [2019-12-18 14:04:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:25,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:04:25,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984746506] [2019-12-18 14:04:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:04:25,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:04:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:04:25,883 INFO L87 Difference]: Start difference. First operand 30143 states and 91862 transitions. Second operand 8 states. [2019-12-18 14:04:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:28,072 INFO L93 Difference]: Finished difference Result 40176 states and 120115 transitions. [2019-12-18 14:04:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 14:04:28,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 14:04:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:28,157 INFO L225 Difference]: With dead ends: 40176 [2019-12-18 14:04:28,157 INFO L226 Difference]: Without dead ends: 40048 [2019-12-18 14:04:28,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:04:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40048 states. [2019-12-18 14:04:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40048 to 31836. [2019-12-18 14:04:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2019-12-18 14:04:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 96604 transitions. [2019-12-18 14:04:28,862 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 96604 transitions. Word has length 66 [2019-12-18 14:04:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:28,862 INFO L462 AbstractCegarLoop]: Abstraction has 31836 states and 96604 transitions. [2019-12-18 14:04:28,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:04:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 96604 transitions. [2019-12-18 14:04:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:28,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:28,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:28,902 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-18 14:04:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:28,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1044982614, now seen corresponding path program 7 times [2019-12-18 14:04:28,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:28,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292148495] [2019-12-18 14:04:28,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:29,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-18 14:04:29,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292148495] [2019-12-18 14:04:29,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:29,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:04:29,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599399597] [2019-12-18 14:04:29,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:04:29,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:04:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:04:29,146 INFO L87 Difference]: Start difference. First operand 31836 states and 96604 transitions. Second operand 12 states. [2019-12-18 14:04:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:33,456 INFO L93 Difference]: Finished difference Result 42614 states and 127066 transitions. [2019-12-18 14:04:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 14:04:33,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 14:04:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:33,520 INFO L225 Difference]: With dead ends: 42614 [2019-12-18 14:04:33,520 INFO L226 Difference]: Without dead ends: 42614 [2019-12-18 14:04:33,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:04:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42614 states. [2019-12-18 14:04:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42614 to 31239. [2019-12-18 14:04:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31239 states. [2019-12-18 14:04:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31239 states to 31239 states and 94981 transitions. [2019-12-18 14:04:34,102 INFO L78 Accepts]: Start accepts. Automaton has 31239 states and 94981 transitions. Word has length 66 [2019-12-18 14:04:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:34,103 INFO L462 AbstractCegarLoop]: Abstraction has 31239 states and 94981 transitions. [2019-12-18 14:04:34,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:04:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31239 states and 94981 transitions. [2019-12-18 14:04:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:34,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:34,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:34,133 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-18 14:04:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1833986216, now seen corresponding path program 8 times [2019-12-18 14:04:34,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:34,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208040274] [2019-12-18 14:04:34,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:34,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208040274] [2019-12-18 14:04:34,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:34,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:04:34,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051638233] [2019-12-18 14:04:34,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:04:34,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:34,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:04:34,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:04:34,282 INFO L87 Difference]: Start difference. First operand 31239 states and 94981 transitions. Second operand 12 states. [2019-12-18 14:04:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:36,293 INFO L93 Difference]: Finished difference Result 46835 states and 141831 transitions. [2019-12-18 14:04:36,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:04:36,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 14:04:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:36,359 INFO L225 Difference]: With dead ends: 46835 [2019-12-18 14:04:36,359 INFO L226 Difference]: Without dead ends: 44740 [2019-12-18 14:04:36,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:04:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44740 states. [2019-12-18 14:04:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44740 to 31011. [2019-12-18 14:04:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31011 states. [2019-12-18 14:04:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31011 states to 31011 states and 94383 transitions. [2019-12-18 14:04:37,185 INFO L78 Accepts]: Start accepts. Automaton has 31011 states and 94383 transitions. Word has length 66 [2019-12-18 14:04:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:37,185 INFO L462 AbstractCegarLoop]: Abstraction has 31011 states and 94383 transitions. [2019-12-18 14:04:37,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:04:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31011 states and 94383 transitions. [2019-12-18 14:04:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:37,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:37,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:37,219 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-18 14:04:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 9 times [2019-12-18 14:04:37,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:37,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770914943] [2019-12-18 14:04:37,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:37,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770914943] [2019-12-18 14:04:37,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:04:37,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925271103] [2019-12-18 14:04:37,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:04:37,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:04:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:04:37,738 INFO L87 Difference]: Start difference. First operand 31011 states and 94383 transitions. Second operand 19 states. [2019-12-18 14:04:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:42,835 INFO L93 Difference]: Finished difference Result 33599 states and 101954 transitions. [2019-12-18 14:04:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:04:42,836 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-18 14:04:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:42,883 INFO L225 Difference]: With dead ends: 33599 [2019-12-18 14:04:42,883 INFO L226 Difference]: Without dead ends: 32640 [2019-12-18 14:04:42,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=305, Invalid=1951, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:04:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32640 states. [2019-12-18 14:04:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32640 to 31366. [2019-12-18 14:04:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31366 states. [2019-12-18 14:04:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31366 states to 31366 states and 95420 transitions. [2019-12-18 14:04:43,556 INFO L78 Accepts]: Start accepts. Automaton has 31366 states and 95420 transitions. Word has length 66 [2019-12-18 14:04:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:43,556 INFO L462 AbstractCegarLoop]: Abstraction has 31366 states and 95420 transitions. [2019-12-18 14:04:43,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:04:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31366 states and 95420 transitions. [2019-12-18 14:04:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:43,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:43,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:43,589 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-18 14:04:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2052995732, now seen corresponding path program 10 times [2019-12-18 14:04:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:43,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132548655] [2019-12-18 14:04:43,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:44,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132548655] [2019-12-18 14:04:44,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:44,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:04:44,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323921544] [2019-12-18 14:04:44,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:04:44,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:04:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:04:44,102 INFO L87 Difference]: Start difference. First operand 31366 states and 95420 transitions. Second operand 19 states. [2019-12-18 14:04:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:49,192 INFO L93 Difference]: Finished difference Result 33977 states and 102920 transitions. [2019-12-18 14:04:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 14:04:49,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-18 14:04:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:49,241 INFO L225 Difference]: With dead ends: 33977 [2019-12-18 14:04:49,241 INFO L226 Difference]: Without dead ends: 32762 [2019-12-18 14:04:49,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:04:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32762 states. [2019-12-18 14:04:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32762 to 31344. [2019-12-18 14:04:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31344 states. [2019-12-18 14:04:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31344 states to 31344 states and 95320 transitions. [2019-12-18 14:04:49,939 INFO L78 Accepts]: Start accepts. Automaton has 31344 states and 95320 transitions. Word has length 66 [2019-12-18 14:04:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:49,939 INFO L462 AbstractCegarLoop]: Abstraction has 31344 states and 95320 transitions. [2019-12-18 14:04:49,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:04:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31344 states and 95320 transitions. [2019-12-18 14:04:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:49,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:49,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:49,973 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-18 14:04:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1401075272, now seen corresponding path program 11 times [2019-12-18 14:04:49,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:49,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315238614] [2019-12-18 14:04:49,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:50,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315238614] [2019-12-18 14:04:50,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:50,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:04:50,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331478876] [2019-12-18 14:04:50,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:04:50,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:04:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:04:50,305 INFO L87 Difference]: Start difference. First operand 31344 states and 95320 transitions. Second operand 14 states. [2019-12-18 14:04:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:54,186 INFO L93 Difference]: Finished difference Result 49079 states and 148167 transitions. [2019-12-18 14:04:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 14:04:54,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 14:04:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:54,248 INFO L225 Difference]: With dead ends: 49079 [2019-12-18 14:04:54,249 INFO L226 Difference]: Without dead ends: 45113 [2019-12-18 14:04:54,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 14:04:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45113 states. [2019-12-18 14:04:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45113 to 31559. [2019-12-18 14:04:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31559 states. [2019-12-18 14:04:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31559 states to 31559 states and 95966 transitions. [2019-12-18 14:04:54,838 INFO L78 Accepts]: Start accepts. Automaton has 31559 states and 95966 transitions. Word has length 66 [2019-12-18 14:04:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:54,838 INFO L462 AbstractCegarLoop]: Abstraction has 31559 states and 95966 transitions. [2019-12-18 14:04:54,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:04:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31559 states and 95966 transitions. [2019-12-18 14:04:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:54,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:54,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:54,873 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:04:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1140517676, now seen corresponding path program 12 times [2019-12-18 14:04:54,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:54,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432109265] [2019-12-18 14:04:54,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:55,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432109265] [2019-12-18 14:04:55,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:55,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:55,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023091407] [2019-12-18 14:04:55,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:55,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:55,205 INFO L87 Difference]: Start difference. First operand 31559 states and 95966 transitions. Second operand 11 states. [2019-12-18 14:04:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:56,748 INFO L93 Difference]: Finished difference Result 68928 states and 209008 transitions. [2019-12-18 14:04:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:04:56,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:56,840 INFO L225 Difference]: With dead ends: 68928 [2019-12-18 14:04:56,840 INFO L226 Difference]: Without dead ends: 64142 [2019-12-18 14:04:56,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:04:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64142 states. [2019-12-18 14:04:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64142 to 35152. [2019-12-18 14:04:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35152 states. [2019-12-18 14:04:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35152 states to 35152 states and 106637 transitions. [2019-12-18 14:04:57,643 INFO L78 Accepts]: Start accepts. Automaton has 35152 states and 106637 transitions. Word has length 66 [2019-12-18 14:04:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:57,643 INFO L462 AbstractCegarLoop]: Abstraction has 35152 states and 106637 transitions. [2019-12-18 14:04:57,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 35152 states and 106637 transitions. [2019-12-18 14:04:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:57,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:57,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:04:57,680 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:04:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1185512468, now seen corresponding path program 13 times [2019-12-18 14:04:57,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:57,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800574263] [2019-12-18 14:04:57,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:04:58,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800574263] [2019-12-18 14:04:58,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:58,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 14:04:58,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229539412] [2019-12-18 14:04:58,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:04:58,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:04:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:04:58,391 INFO L87 Difference]: Start difference. First operand 35152 states and 106637 transitions. Second operand 21 states. [2019-12-18 14:05:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:03,587 INFO L93 Difference]: Finished difference Result 43314 states and 131986 transitions. [2019-12-18 14:05:03,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:05:03,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-18 14:05:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:03,647 INFO L225 Difference]: With dead ends: 43314 [2019-12-18 14:05:03,648 INFO L226 Difference]: Without dead ends: 43232 [2019-12-18 14:05:03,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 14:05:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43232 states. [2019-12-18 14:05:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43232 to 35409. [2019-12-18 14:05:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35409 states. [2019-12-18 14:05:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35409 states to 35409 states and 107415 transitions. [2019-12-18 14:05:04,262 INFO L78 Accepts]: Start accepts. Automaton has 35409 states and 107415 transitions. Word has length 66 [2019-12-18 14:05:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:04,263 INFO L462 AbstractCegarLoop]: Abstraction has 35409 states and 107415 transitions. [2019-12-18 14:05:04,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:05:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35409 states and 107415 transitions. [2019-12-18 14:05:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:05:04,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:04,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:04,298 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash 400141838, now seen corresponding path program 14 times [2019-12-18 14:05:04,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:04,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606778373] [2019-12-18 14:05:04,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:05:05,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606778373] [2019-12-18 14:05:05,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:05,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:05:05,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715405237] [2019-12-18 14:05:05,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 14:05:05,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:05,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 14:05:05,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:05:05,102 INFO L87 Difference]: Start difference. First operand 35409 states and 107415 transitions. Second operand 22 states. [2019-12-18 14:05:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:10,607 INFO L93 Difference]: Finished difference Result 43710 states and 133096 transitions. [2019-12-18 14:05:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 14:05:10,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-18 14:05:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:10,667 INFO L225 Difference]: With dead ends: 43710 [2019-12-18 14:05:10,667 INFO L226 Difference]: Without dead ends: 42971 [2019-12-18 14:05:10,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:05:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42971 states. [2019-12-18 14:05:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42971 to 35385. [2019-12-18 14:05:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35385 states. [2019-12-18 14:05:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35385 states to 35385 states and 107349 transitions. [2019-12-18 14:05:11,262 INFO L78 Accepts]: Start accepts. Automaton has 35385 states and 107349 transitions. Word has length 66 [2019-12-18 14:05:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:11,262 INFO L462 AbstractCegarLoop]: Abstraction has 35385 states and 107349 transitions. [2019-12-18 14:05:11,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 14:05:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35385 states and 107349 transitions. [2019-12-18 14:05:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:05:11,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:11,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:11,297 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 831172802, now seen corresponding path program 15 times [2019-12-18 14:05:11,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:11,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169544569] [2019-12-18 14:05:11,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:05:11,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169544569] [2019-12-18 14:05:11,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:11,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:05:11,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451033859] [2019-12-18 14:05:11,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:05:11,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:05:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:11,364 INFO L87 Difference]: Start difference. First operand 35385 states and 107349 transitions. Second operand 3 states. [2019-12-18 14:05:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:11,522 INFO L93 Difference]: Finished difference Result 35385 states and 107348 transitions. [2019-12-18 14:05:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:05:11,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:05:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:11,571 INFO L225 Difference]: With dead ends: 35385 [2019-12-18 14:05:11,571 INFO L226 Difference]: Without dead ends: 35385 [2019-12-18 14:05:11,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:05:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35385 states. [2019-12-18 14:05:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35385 to 25990. [2019-12-18 14:05:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25990 states. [2019-12-18 14:05:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25990 states to 25990 states and 79984 transitions. [2019-12-18 14:05:12,064 INFO L78 Accepts]: Start accepts. Automaton has 25990 states and 79984 transitions. Word has length 66 [2019-12-18 14:05:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:12,064 INFO L462 AbstractCegarLoop]: Abstraction has 25990 states and 79984 transitions. [2019-12-18 14:05:12,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:05:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 25990 states and 79984 transitions. [2019-12-18 14:05:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:05:12,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:12,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:12,094 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1732230978, now seen corresponding path program 1 times [2019-12-18 14:05:12,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:12,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765456763] [2019-12-18 14:05:12,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:05:12,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765456763] [2019-12-18 14:05:12,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:12,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:05:12,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087515735] [2019-12-18 14:05:12,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:05:12,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:12,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:05:12,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:05:12,419 INFO L87 Difference]: Start difference. First operand 25990 states and 79984 transitions. Second operand 11 states. [2019-12-18 14:05:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:13,745 INFO L93 Difference]: Finished difference Result 45672 states and 139838 transitions. [2019-12-18 14:05:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:05:13,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:05:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:13,799 INFO L225 Difference]: With dead ends: 45672 [2019-12-18 14:05:13,800 INFO L226 Difference]: Without dead ends: 36500 [2019-12-18 14:05:13,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:05:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36500 states. [2019-12-18 14:05:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36500 to 20783. [2019-12-18 14:05:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20783 states. [2019-12-18 14:05:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20783 states to 20783 states and 64240 transitions. [2019-12-18 14:05:14,272 INFO L78 Accepts]: Start accepts. Automaton has 20783 states and 64240 transitions. Word has length 67 [2019-12-18 14:05:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:14,272 INFO L462 AbstractCegarLoop]: Abstraction has 20783 states and 64240 transitions. [2019-12-18 14:05:14,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:05:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20783 states and 64240 transitions. [2019-12-18 14:05:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:05:14,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:14,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:14,293 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash -300630794, now seen corresponding path program 2 times [2019-12-18 14:05:14,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:14,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022980072] [2019-12-18 14:05:14,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:05:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:05:14,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022980072] [2019-12-18 14:05:14,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:05:14,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:05:14,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771282506] [2019-12-18 14:05:14,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:05:14,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:05:14,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:05:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:05:14,509 INFO L87 Difference]: Start difference. First operand 20783 states and 64240 transitions. Second operand 12 states. [2019-12-18 14:05:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:05:16,750 INFO L93 Difference]: Finished difference Result 31712 states and 97298 transitions. [2019-12-18 14:05:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:05:16,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 14:05:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:05:16,794 INFO L225 Difference]: With dead ends: 31712 [2019-12-18 14:05:16,794 INFO L226 Difference]: Without dead ends: 31277 [2019-12-18 14:05:16,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:05:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31277 states. [2019-12-18 14:05:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31277 to 20523. [2019-12-18 14:05:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20523 states. [2019-12-18 14:05:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 63578 transitions. [2019-12-18 14:05:17,196 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 63578 transitions. Word has length 67 [2019-12-18 14:05:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:05:17,196 INFO L462 AbstractCegarLoop]: Abstraction has 20523 states and 63578 transitions. [2019-12-18 14:05:17,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:05:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 63578 transitions. [2019-12-18 14:05:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:05:17,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:05:17,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:05:17,218 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:05:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:05:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 3 times [2019-12-18 14:05:17,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:05:17,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658899606] [2019-12-18 14:05:17,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:05:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:05:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:05:17,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:05:17,342 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:05:17,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= (store .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23| 1) |v_#valid_60|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1564~0.base_23| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23|) |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1564~0.base_23|) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1564~0.offset=|v_ULTIMATE.start_main_~#t1564~0.offset_17|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_12|, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ULTIMATE.start_main_~#t1564~0.base=|v_ULTIMATE.start_main_~#t1564~0.base_23|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1564~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1566~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1566~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1565~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1564~0.base, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:05:17,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1565~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1565~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11|) |v_ULTIMATE.start_main_~#t1565~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11|)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1565~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1565~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1565~0.offset] because there is no mapped edge [2019-12-18 14:05:17,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:05:17,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1873165839 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1873165839 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1873165839 |P1Thread1of1ForFork2_#t~ite9_Out-1873165839|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-1873165839 |P1Thread1of1ForFork2_#t~ite9_Out-1873165839|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1873165839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1873165839, ~z$w_buff1~0=~z$w_buff1~0_In-1873165839, ~z~0=~z~0_In-1873165839} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1873165839|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1873165839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1873165839, ~z$w_buff1~0=~z$w_buff1~0_In-1873165839, ~z~0=~z~0_In-1873165839} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:05:17,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 14:05:17,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13|) |v_ULTIMATE.start_main_~#t1566~0.offset_11| 2)) |v_#memory_int_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1566~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1566~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1566~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1566~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1566~0.offset] because there is no mapped edge [2019-12-18 14:05:17,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-944132903 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-944132903 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-944132903| ~z$w_buff0_used~0_In-944132903) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-944132903| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-944132903, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-944132903} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-944132903, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-944132903|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-944132903} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:05:17,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In809597669 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In809597669 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In809597669 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In809597669 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out809597669| ~z$w_buff1_used~0_In809597669)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out809597669| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In809597669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In809597669, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In809597669} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In809597669, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In809597669, ~z$w_buff1_used~0=~z$w_buff1_used~0_In809597669, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out809597669|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In809597669} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 14:05:17,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In856013768 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In856013768 256)))) (or (and (= ~z$r_buff0_thd2~0_In856013768 |P1Thread1of1ForFork2_#t~ite13_Out856013768|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out856013768|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In856013768, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In856013768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In856013768, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out856013768|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In856013768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 14:05:17,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1324434859 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1324434859| ~z$w_buff0_used~0_In-1324434859) (= |P2Thread1of1ForFork0_#t~ite26_In-1324434859| |P2Thread1of1ForFork0_#t~ite26_Out-1324434859|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1324434859 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-1324434859 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1324434859 256) 0)) (= (mod ~z$w_buff0_used~0_In-1324434859 256) 0))) (= ~z$w_buff0_used~0_In-1324434859 |P2Thread1of1ForFork0_#t~ite26_Out-1324434859|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-1324434859| |P2Thread1of1ForFork0_#t~ite26_Out-1324434859|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1324434859|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324434859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1324434859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324434859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1324434859, ~weak$$choice2~0=~weak$$choice2~0_In-1324434859} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1324434859|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1324434859|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324434859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1324434859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324434859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1324434859, ~weak$$choice2~0=~weak$$choice2~0_In-1324434859} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 14:05:17,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:05:17,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1478266112 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1478266112 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1478266112 |P0Thread1of1ForFork1_#t~ite5_Out1478266112|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1478266112|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478266112, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1478266112} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1478266112|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478266112, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1478266112} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 14:05:17,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:05:17,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In670993497 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In670993497 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out670993497| |P2Thread1of1ForFork0_#t~ite39_Out670993497|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out670993497| ~z$w_buff1~0_In670993497) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out670993497| ~z~0_In670993497) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In670993497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670993497, ~z$w_buff1~0=~z$w_buff1~0_In670993497, ~z~0=~z~0_In670993497} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out670993497|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out670993497|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In670993497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670993497, ~z$w_buff1~0=~z$w_buff1~0_In670993497, ~z~0=~z~0_In670993497} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 14:05:17,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-754307120 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-754307120 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-754307120| ~z$w_buff0_used~0_In-754307120) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-754307120| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-754307120, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-754307120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-754307120, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-754307120|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-754307120} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 14:05:17,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-742463499 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-742463499 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-742463499 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-742463499 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-742463499 |P2Thread1of1ForFork0_#t~ite41_Out-742463499|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-742463499|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-742463499, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-742463499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-742463499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-742463499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-742463499, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-742463499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-742463499, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-742463499, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-742463499|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 14:05:17,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In472045153 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In472045153 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out472045153| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out472045153| ~z$r_buff0_thd3~0_In472045153) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In472045153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In472045153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In472045153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In472045153, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out472045153|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 14:05:17,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1320854584 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1320854584 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1320854584 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1320854584 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1320854584|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1320854584 |P2Thread1of1ForFork0_#t~ite43_Out-1320854584|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1320854584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1320854584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1320854584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1320854584} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1320854584|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1320854584, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1320854584, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1320854584, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1320854584} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 14:05:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 14:05:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1184161856 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1184161856 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1184161856 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1184161856 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1184161856|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1184161856 |P0Thread1of1ForFork1_#t~ite6_Out1184161856|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1184161856, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1184161856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1184161856, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1184161856} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1184161856, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1184161856|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1184161856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1184161856, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1184161856} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 14:05:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1382499478 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1382499478 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1382499478 ~z$r_buff0_thd1~0_Out-1382499478)) (and (= ~z$r_buff0_thd1~0_Out-1382499478 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382499478, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1382499478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1382499478, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1382499478|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1382499478} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:05:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In-1438155138 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1438155138 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1438155138 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1438155138 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1438155138| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-1438155138| ~z$r_buff1_thd1~0_In-1438155138)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438155138, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1438155138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438155138, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1438155138} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1438155138|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1438155138, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1438155138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1438155138, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1438155138} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 14:05:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:05:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In42487028 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In42487028 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In42487028 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In42487028 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out42487028| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In42487028 |P1Thread1of1ForFork2_#t~ite14_Out42487028|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In42487028, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In42487028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In42487028, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In42487028} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In42487028, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In42487028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In42487028, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out42487028|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In42487028} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:05:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 14:05:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:05:17,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2063315328 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2063315328 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-2063315328| |ULTIMATE.start_main_#t~ite47_Out-2063315328|))) (or (and (= ~z$w_buff1~0_In-2063315328 |ULTIMATE.start_main_#t~ite47_Out-2063315328|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-2063315328 |ULTIMATE.start_main_#t~ite47_Out-2063315328|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2063315328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2063315328, ~z$w_buff1~0=~z$w_buff1~0_In-2063315328, ~z~0=~z~0_In-2063315328} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2063315328, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2063315328|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2063315328, ~z$w_buff1~0=~z$w_buff1~0_In-2063315328, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2063315328|, ~z~0=~z~0_In-2063315328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:05:17,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In719200686 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In719200686 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In719200686 |ULTIMATE.start_main_#t~ite49_Out719200686|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out719200686|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In719200686, ~z$w_buff0_used~0=~z$w_buff0_used~0_In719200686} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In719200686, ~z$w_buff0_used~0=~z$w_buff0_used~0_In719200686, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out719200686|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:05:17,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1777279331 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1777279331 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1777279331 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1777279331 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1777279331|)) (and (= ~z$w_buff1_used~0_In-1777279331 |ULTIMATE.start_main_#t~ite50_Out-1777279331|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1777279331, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1777279331, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1777279331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1777279331} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1777279331|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1777279331, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1777279331, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1777279331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1777279331} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:05:17,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1497367153 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1497367153 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1497367153 |ULTIMATE.start_main_#t~ite51_Out-1497367153|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1497367153|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1497367153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1497367153, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1497367153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1497367153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:05:17,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1273163370 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1273163370 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1273163370 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1273163370 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1273163370| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1273163370| ~z$r_buff1_thd0~0_In1273163370)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1273163370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1273163370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1273163370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273163370} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1273163370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1273163370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1273163370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1273163370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273163370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:05:17,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:05:17,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:05:17 BasicIcfg [2019-12-18 14:05:17,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:05:17,492 INFO L168 Benchmark]: Toolchain (without parser) took 161420.86 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,492 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.71 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,494 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,494 INFO L168 Benchmark]: RCFGBuilder took 857.69 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.8 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,494 INFO L168 Benchmark]: TraceAbstraction took 159653.56 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 14:05:17,497 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.11 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.71 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.70 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.69 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.8 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159653.56 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1564, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1565, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1566, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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 [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, 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=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 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) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 159.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 71.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9488 SDtfs, 12003 SDslu, 43818 SDs, 0 SdLazy, 45843 SolverSat, 673 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 65 SyntacticMatches, 37 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4265 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 314577 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1783 NumberOfCodeBlocks, 1783 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1683 ConstructedInterpolants, 0 QuantifiedInterpolants, 624566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...