/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:36:32,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:36:32,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:36:32,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:36:32,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:36:32,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:36:32,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:36:32,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:36:32,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:36:32,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:36:32,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:36:32,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:36:32,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:36:32,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:36:32,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:36:32,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:36:32,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:36:32,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:36:32,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:36:32,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:36:32,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:36:32,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:36:32,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:36:32,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:36:32,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:36:32,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:36:32,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:36:32,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:36:32,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:36:32,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:36:32,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:36:32,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:36:32,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:36:32,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:36:32,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:36:32,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:36:32,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:36:32,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:36:32,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:36:32,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:36:32,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:36:32,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:36:32,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:36:32,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:36:32,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:36:32,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:36:32,926 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:36:32,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:36:32,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:36:32,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:36:32,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:36:32,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:36:32,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:36:32,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:36:32,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:36:32,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:36:32,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:36:32,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:36:32,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:36:32,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:36:32,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:36:32,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:36:32,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:36:32,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:36:32,930 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:36:32,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:36:32,932 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:36:32,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:36:33,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:36:33,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:36:33,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:36:33,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:36:33,232 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:36:33,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2019-12-27 17:36:33,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c0861ed/7f46633450e6437aa56903e830a36fe6/FLAG6e0d60fa7 [2019-12-27 17:36:33,857 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:36:33,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2019-12-27 17:36:33,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c0861ed/7f46633450e6437aa56903e830a36fe6/FLAG6e0d60fa7 [2019-12-27 17:36:34,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c0861ed/7f46633450e6437aa56903e830a36fe6 [2019-12-27 17:36:34,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:36:34,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:36:34,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:34,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:36:34,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:36:34,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34, skipping insertion in model container [2019-12-27 17:36:34,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:34,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:36:34,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:36:34,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:34,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:36:34,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:36:34,986 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:36:34,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34 WrapperNode [2019-12-27 17:36:34,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:36:34,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:34,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:36:34,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:36:34,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:36:35,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:36:35,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:36:35,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:36:35,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (1/1) ... [2019-12-27 17:36:35,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:36:35,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:36:35,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:36:35,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:36:35,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (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-27 17:36:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:36:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:36:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:36:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:36:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:36:35,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:36:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:36:35,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:36:35,196 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:36:35,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:36:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:36:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:36:35,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:36:35,199 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:36:35,992 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:36:35,993 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:36:35,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:35 BoogieIcfgContainer [2019-12-27 17:36:35,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:36:35,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:36:35,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:36:35,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:36:36,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:36:34" (1/3) ... [2019-12-27 17:36:36,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7804dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:36, skipping insertion in model container [2019-12-27 17:36:36,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:36:34" (2/3) ... [2019-12-27 17:36:36,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7804dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:36:36, skipping insertion in model container [2019-12-27 17:36:36,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:36:35" (3/3) ... [2019-12-27 17:36:36,003 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.opt.i [2019-12-27 17:36:36,010 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:36:36,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:36:36,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:36:36,019 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:36:36,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,095 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,123 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,125 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:36:36,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:36:36,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:36:36,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:36:36,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:36:36,176 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:36:36,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:36:36,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:36:36,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:36:36,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:36:36,194 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 17:36:36,196 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:36,298 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:36,299 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:36,315 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. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:36,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 17:36:36,395 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 17:36:36,395 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:36:36,404 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. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:36:36,427 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:36:36,428 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:36:39,131 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 17:36:41,802 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 17:36:41,917 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:36:42,262 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 17:36:42,262 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:36:42,266 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 17:37:06,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 17:37:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 17:37:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:37:06,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:06,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:37:06,676 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-27 17:37:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 17:37:06,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:06,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228034905] [2019-12-27 17:37:06,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:06,890 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-27 17:37:06,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228034905] [2019-12-27 17:37:06,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:06,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:37:06,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1776787508] [2019-12-27 17:37:06,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:06,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:06,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:37:06,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:06,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:06,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:06,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:06,938 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 17:37:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:08,039 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 17:37:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:08,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:37:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:11,819 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 17:37:11,819 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 17:37:11,820 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-27 17:37:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 17:37:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 17:37:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 17:37:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 17:37:19,693 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 17:37:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:19,694 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 17:37:19,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 17:37:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:37:19,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:19,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:19,699 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-27 17:37:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 17:37:19,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:19,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931906535] [2019-12-27 17:37:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:19,792 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-27 17:37:19,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931906535] [2019-12-27 17:37:19,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:19,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:19,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956439332] [2019-12-27 17:37:19,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:19,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:19,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:37:19,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:19,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:19,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:37:19,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:37:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:37:19,801 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 17:37:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:25,345 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 17:37:25,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:25,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:37:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:26,110 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 17:37:26,111 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 17:37:26,112 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-27 17:37:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 17:37:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 17:37:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 17:37:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 17:37:43,804 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 17:37:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:43,804 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 17:37:43,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:37:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 17:37:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:37:43,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:43,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:43,821 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-27 17:37:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 17:37:43,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:43,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847549042] [2019-12-27 17:37:43,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:43,924 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-27 17:37:43,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847549042] [2019-12-27 17:37:43,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:43,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:37:43,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315552375] [2019-12-27 17:37:43,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:43,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:43,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:37:43,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:43,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:43,937 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 17:37:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:44,110 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 17:37:44,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:44,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:37:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:44,169 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 17:37:44,169 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 17:37:44,169 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-27 17:37:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 17:37:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 17:37:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 17:37:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 17:37:44,809 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 17:37:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:44,809 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 17:37:44,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 17:37:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:44,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:44,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:44,815 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-27 17:37:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 17:37:44,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:44,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078067131] [2019-12-27 17:37:44,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:44,896 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-27 17:37:44,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078067131] [2019-12-27 17:37:44,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:44,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:44,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790209660] [2019-12-27 17:37:44,898 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:44,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:44,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:44,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:44,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:44,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:37:44,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:37:44,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:37:44,909 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 17:37:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:45,121 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 17:37:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:37:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:37:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:45,216 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 17:37:45,216 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 17:37:45,216 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-27 17:37:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 17:37:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 17:37:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 17:37:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 17:37:47,092 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 17:37:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:47,093 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 17:37:47,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:37:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 17:37:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:37:47,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:47,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:47,097 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-27 17:37:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 17:37:47,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:47,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395316406] [2019-12-27 17:37:47,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:47,208 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-27 17:37:47,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395316406] [2019-12-27 17:37:47,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:47,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:47,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [472722344] [2019-12-27 17:37:47,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:47,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:47,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:37:47,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:47,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:47,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:47,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:47,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:47,215 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 17:37:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:47,788 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 17:37:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:37:47,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:37:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:47,890 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 17:37:47,890 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 17:37:47,891 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-27 17:37:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 17:37:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 17:37:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 17:37:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 17:37:49,526 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 17:37:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:49,526 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 17:37:49,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 17:37:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:37:49,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:49,540 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-27 17:37:49,541 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-27 17:37:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 17:37:49,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:49,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076906574] [2019-12-27 17:37:49,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:49,657 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-27 17:37:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076906574] [2019-12-27 17:37:49,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:49,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:49,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965267278] [2019-12-27 17:37:49,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:49,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:49,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:37:49,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:49,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:49,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:49,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:49,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:49,716 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 7 states. [2019-12-27 17:37:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:50,846 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 17:37:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:37:50,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:37:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:50,983 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 17:37:50,983 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 17:37:50,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:37:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 17:37:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 17:37:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 17:37:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 17:37:52,007 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 17:37:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:52,007 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 17:37:52,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 17:37:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:37:52,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:52,025 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-27 17:37:52,026 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-27 17:37:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:52,026 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 17:37:52,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:52,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832145775] [2019-12-27 17:37:52,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:52,079 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-27 17:37:52,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832145775] [2019-12-27 17:37:52,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:52,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:37:52,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254751616] [2019-12-27 17:37:52,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:52,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:52,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:37:52,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:52,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:37:52,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:37:52,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:37:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:37:52,110 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 5 states. [2019-12-27 17:37:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:52,222 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 17:37:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:37:52,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:37:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:52,257 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 17:37:52,257 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 17:37:52,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-27 17:37:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 17:37:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 17:37:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 17:37:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 17:37:53,012 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 17:37:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:53,013 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 17:37:53,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:37:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 17:37:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:37:53,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:53,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:37:53,027 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-27 17:37:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 17:37:53,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:53,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804048038] [2019-12-27 17:37:53,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:53,110 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-27 17:37:53,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804048038] [2019-12-27 17:37:53,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:53,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:53,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969207501] [2019-12-27 17:37:53,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:53,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:53,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:37:53,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:53,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:37:53,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:37:53,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:37:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:37:53,121 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 17:37:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:53,718 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 17:37:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:37:53,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:37:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:53,757 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 17:37:53,758 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 17:37:53,758 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-27 17:37:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 17:37:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 17:37:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 17:37:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 17:37:54,128 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 17:37:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:54,128 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 17:37:54,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:37:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 17:37:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:37:54,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:54,150 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-27 17:37:54,150 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-27 17:37:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 17:37:54,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:54,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616707763] [2019-12-27 17:37:54,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:54,242 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-27 17:37:54,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616707763] [2019-12-27 17:37:54,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:54,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:37:54,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589762435] [2019-12-27 17:37:54,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:54,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:54,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:37:54,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:54,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:37:54,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:37:54,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:37:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:37:54,282 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 8 states. [2019-12-27 17:37:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:55,535 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 17:37:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:37:55,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 17:37:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:55,574 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 17:37:55,574 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 17:37:55,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:37:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 17:37:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 17:37:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 17:37:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 17:37:55,942 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 17:37:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:55,942 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 17:37:55,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:37:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 17:37:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:37:55,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:55,968 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-27 17:37:55,968 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-27 17:37:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 17:37:55,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838062665] [2019-12-27 17:37:55,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:56,059 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-27 17:37:56,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838062665] [2019-12-27 17:37:56,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:56,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:37:56,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160527244] [2019-12-27 17:37:56,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:56,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:56,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 17:37:56,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:56,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:37:56,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:37:56,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:37:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:37:56,186 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 8 states. [2019-12-27 17:37:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:57,657 INFO L93 Difference]: Finished difference Result 27820 states and 84657 transitions. [2019-12-27 17:37:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:37:57,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 17:37:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:57,701 INFO L225 Difference]: With dead ends: 27820 [2019-12-27 17:37:57,702 INFO L226 Difference]: Without dead ends: 27820 [2019-12-27 17:37:57,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:37:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27820 states. [2019-12-27 17:37:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27820 to 25942. [2019-12-27 17:37:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25942 states. [2019-12-27 17:37:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25942 states to 25942 states and 79458 transitions. [2019-12-27 17:37:58,159 INFO L78 Accepts]: Start accepts. Automaton has 25942 states and 79458 transitions. Word has length 39 [2019-12-27 17:37:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:58,159 INFO L462 AbstractCegarLoop]: Abstraction has 25942 states and 79458 transitions. [2019-12-27 17:37:58,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:37:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 25942 states and 79458 transitions. [2019-12-27 17:37:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:37:58,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:58,193 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-27 17:37:58,193 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-27 17:37:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1070465324, now seen corresponding path program 2 times [2019-12-27 17:37:58,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:58,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731957423] [2019-12-27 17:37:58,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:58,269 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-27 17:37:58,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731957423] [2019-12-27 17:37:58,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:58,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:37:58,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742846648] [2019-12-27 17:37:58,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:58,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:58,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 17:37:58,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:58,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:37:58,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:37:58,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:37:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:58,372 INFO L87 Difference]: Start difference. First operand 25942 states and 79458 transitions. Second operand 7 states. [2019-12-27 17:37:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:37:58,475 INFO L93 Difference]: Finished difference Result 24570 states and 76229 transitions. [2019-12-27 17:37:58,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:37:58,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:37:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:37:58,511 INFO L225 Difference]: With dead ends: 24570 [2019-12-27 17:37:58,511 INFO L226 Difference]: Without dead ends: 24570 [2019-12-27 17:37:58,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:37:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24570 states. [2019-12-27 17:37:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24570 to 23604. [2019-12-27 17:37:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23604 states. [2019-12-27 17:37:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23604 states to 23604 states and 73623 transitions. [2019-12-27 17:37:58,917 INFO L78 Accepts]: Start accepts. Automaton has 23604 states and 73623 transitions. Word has length 39 [2019-12-27 17:37:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:37:58,917 INFO L462 AbstractCegarLoop]: Abstraction has 23604 states and 73623 transitions. [2019-12-27 17:37:58,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:37:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 23604 states and 73623 transitions. [2019-12-27 17:37:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:37:58,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:37:58,949 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-27 17:37:58,950 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-27 17:37:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:37:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash 405396675, now seen corresponding path program 1 times [2019-12-27 17:37:58,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:37:58,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997487034] [2019-12-27 17:37:58,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:37:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:37:59,069 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-27 17:37:59,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997487034] [2019-12-27 17:37:59,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:37:59,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:37:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399467497] [2019-12-27 17:37:59,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:37:59,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:37:59,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 321 transitions. [2019-12-27 17:37:59,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:37:59,314 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:37:59,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:37:59,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:37:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:37:59,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:37:59,315 INFO L87 Difference]: Start difference. First operand 23604 states and 73623 transitions. Second operand 8 states. [2019-12-27 17:38:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:00,646 INFO L93 Difference]: Finished difference Result 80320 states and 248709 transitions. [2019-12-27 17:38:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:38:00,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:38:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:00,744 INFO L225 Difference]: With dead ends: 80320 [2019-12-27 17:38:00,745 INFO L226 Difference]: Without dead ends: 64791 [2019-12-27 17:38:00,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64791 states. [2019-12-27 17:38:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64791 to 27152. [2019-12-27 17:38:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27152 states. [2019-12-27 17:38:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27152 states to 27152 states and 85280 transitions. [2019-12-27 17:38:01,510 INFO L78 Accepts]: Start accepts. Automaton has 27152 states and 85280 transitions. Word has length 64 [2019-12-27 17:38:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:01,510 INFO L462 AbstractCegarLoop]: Abstraction has 27152 states and 85280 transitions. [2019-12-27 17:38:01,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:38:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 27152 states and 85280 transitions. [2019-12-27 17:38:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:38:01,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:01,553 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-27 17:38:01,554 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-27 17:38:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1812165217, now seen corresponding path program 2 times [2019-12-27 17:38:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239542554] [2019-12-27 17:38:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:01,661 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-27 17:38:01,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239542554] [2019-12-27 17:38:01,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:01,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:38:01,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870056746] [2019-12-27 17:38:01,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:01,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:01,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 275 transitions. [2019-12-27 17:38:01,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:01,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:38:01,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:38:01,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:38:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:38:01,933 INFO L87 Difference]: Start difference. First operand 27152 states and 85280 transitions. Second operand 10 states. [2019-12-27 17:38:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:03,958 INFO L93 Difference]: Finished difference Result 86374 states and 267741 transitions. [2019-12-27 17:38:03,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:38:03,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:38:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:04,117 INFO L225 Difference]: With dead ends: 86374 [2019-12-27 17:38:04,117 INFO L226 Difference]: Without dead ends: 63707 [2019-12-27 17:38:04,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:38:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63707 states. [2019-12-27 17:38:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63707 to 31627. [2019-12-27 17:38:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31627 states. [2019-12-27 17:38:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31627 states to 31627 states and 99154 transitions. [2019-12-27 17:38:05,474 INFO L78 Accepts]: Start accepts. Automaton has 31627 states and 99154 transitions. Word has length 64 [2019-12-27 17:38:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:05,474 INFO L462 AbstractCegarLoop]: Abstraction has 31627 states and 99154 transitions. [2019-12-27 17:38:05,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:38:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 31627 states and 99154 transitions. [2019-12-27 17:38:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:38:05,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:05,509 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-27 17:38:05,509 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-27 17:38:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -665020085, now seen corresponding path program 3 times [2019-12-27 17:38:05,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:05,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294198187] [2019-12-27 17:38:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:05,613 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-27 17:38:05,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294198187] [2019-12-27 17:38:05,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:05,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:38:05,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973173058] [2019-12-27 17:38:05,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:05,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:05,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 361 transitions. [2019-12-27 17:38:05,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:05,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:38:05,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:38:05,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:38:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:38:05,845 INFO L87 Difference]: Start difference. First operand 31627 states and 99154 transitions. Second operand 8 states. [2019-12-27 17:38:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:07,312 INFO L93 Difference]: Finished difference Result 85961 states and 264285 transitions. [2019-12-27 17:38:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:38:07,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:38:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:07,426 INFO L225 Difference]: With dead ends: 85961 [2019-12-27 17:38:07,427 INFO L226 Difference]: Without dead ends: 76683 [2019-12-27 17:38:07,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:38:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76683 states. [2019-12-27 17:38:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76683 to 31935. [2019-12-27 17:38:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31935 states. [2019-12-27 17:38:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31935 states to 31935 states and 100105 transitions. [2019-12-27 17:38:08,820 INFO L78 Accepts]: Start accepts. Automaton has 31935 states and 100105 transitions. Word has length 64 [2019-12-27 17:38:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:08,820 INFO L462 AbstractCegarLoop]: Abstraction has 31935 states and 100105 transitions. [2019-12-27 17:38:08,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:38:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31935 states and 100105 transitions. [2019-12-27 17:38:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:38:08,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:08,857 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-27 17:38:08,857 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-27 17:38:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 17:38:08,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:08,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753504097] [2019-12-27 17:38:08,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:08,928 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-27 17:38:08,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753504097] [2019-12-27 17:38:08,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:08,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:08,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592247352] [2019-12-27 17:38:08,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:08,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:09,251 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 500 transitions. [2019-12-27 17:38:09,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:09,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:09,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:38:09,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:38:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:09,253 INFO L87 Difference]: Start difference. First operand 31935 states and 100105 transitions. Second operand 3 states. [2019-12-27 17:38:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:09,417 INFO L93 Difference]: Finished difference Result 37968 states and 118161 transitions. [2019-12-27 17:38:09,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:38:09,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:38:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:09,479 INFO L225 Difference]: With dead ends: 37968 [2019-12-27 17:38:09,479 INFO L226 Difference]: Without dead ends: 37968 [2019-12-27 17:38:09,480 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-27 17:38:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37968 states. [2019-12-27 17:38:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37968 to 33207. [2019-12-27 17:38:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33207 states. [2019-12-27 17:38:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33207 states to 33207 states and 104097 transitions. [2019-12-27 17:38:10,044 INFO L78 Accepts]: Start accepts. Automaton has 33207 states and 104097 transitions. Word has length 64 [2019-12-27 17:38:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:10,044 INFO L462 AbstractCegarLoop]: Abstraction has 33207 states and 104097 transitions. [2019-12-27 17:38:10,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:38:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 33207 states and 104097 transitions. [2019-12-27 17:38:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:38:10,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:10,081 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-27 17:38:10,081 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-27 17:38:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1190965355, now seen corresponding path program 1 times [2019-12-27 17:38:10,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:10,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649844998] [2019-12-27 17:38:10,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:10,174 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-27 17:38:10,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649844998] [2019-12-27 17:38:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:38:10,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797261415] [2019-12-27 17:38:10,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:10,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:10,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 284 transitions. [2019-12-27 17:38:10,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:10,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:38:10,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:38:10,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:38:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:38:10,801 INFO L87 Difference]: Start difference. First operand 33207 states and 104097 transitions. Second operand 7 states. [2019-12-27 17:38:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:11,372 INFO L93 Difference]: Finished difference Result 68708 states and 212400 transitions. [2019-12-27 17:38:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:38:11,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 17:38:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:11,465 INFO L225 Difference]: With dead ends: 68708 [2019-12-27 17:38:11,465 INFO L226 Difference]: Without dead ends: 63685 [2019-12-27 17:38:11,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:38:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63685 states. [2019-12-27 17:38:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63685 to 33271. [2019-12-27 17:38:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33271 states. [2019-12-27 17:38:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33271 states to 33271 states and 104315 transitions. [2019-12-27 17:38:12,227 INFO L78 Accepts]: Start accepts. Automaton has 33271 states and 104315 transitions. Word has length 65 [2019-12-27 17:38:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:12,227 INFO L462 AbstractCegarLoop]: Abstraction has 33271 states and 104315 transitions. [2019-12-27 17:38:12,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:38:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33271 states and 104315 transitions. [2019-12-27 17:38:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:38:12,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:12,266 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-27 17:38:12,266 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-27 17:38:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1399950855, now seen corresponding path program 2 times [2019-12-27 17:38:12,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:12,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767478931] [2019-12-27 17:38:12,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:12,347 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-27 17:38:12,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767478931] [2019-12-27 17:38:12,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:12,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:38:12,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784355733] [2019-12-27 17:38:12,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:12,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:12,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 390 transitions. [2019-12-27 17:38:12,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:12,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:12,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:12,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:12,707 INFO L87 Difference]: Start difference. First operand 33271 states and 104315 transitions. Second operand 4 states. [2019-12-27 17:38:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:13,029 INFO L93 Difference]: Finished difference Result 38643 states and 120280 transitions. [2019-12-27 17:38:13,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:38:13,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 17:38:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:13,115 INFO L225 Difference]: With dead ends: 38643 [2019-12-27 17:38:13,116 INFO L226 Difference]: Without dead ends: 38643 [2019-12-27 17:38:13,116 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-27 17:38:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38643 states. [2019-12-27 17:38:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38643 to 33436. [2019-12-27 17:38:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33436 states. [2019-12-27 17:38:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33436 states to 33436 states and 104768 transitions. [2019-12-27 17:38:14,144 INFO L78 Accepts]: Start accepts. Automaton has 33436 states and 104768 transitions. Word has length 65 [2019-12-27 17:38:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:14,144 INFO L462 AbstractCegarLoop]: Abstraction has 33436 states and 104768 transitions. [2019-12-27 17:38:14,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33436 states and 104768 transitions. [2019-12-27 17:38:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:38:14,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:14,180 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-27 17:38:14,180 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-27 17:38:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash 993840143, now seen corresponding path program 1 times [2019-12-27 17:38:14,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:14,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329851154] [2019-12-27 17:38:14,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:14,252 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-27 17:38:14,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329851154] [2019-12-27 17:38:14,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:14,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:14,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033096622] [2019-12-27 17:38:14,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:14,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:14,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 501 transitions. [2019-12-27 17:38:14,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:14,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:38:14,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:38:14,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:38:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:38:14,526 INFO L87 Difference]: Start difference. First operand 33436 states and 104768 transitions. Second operand 3 states. [2019-12-27 17:38:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:14,631 INFO L93 Difference]: Finished difference Result 33436 states and 104767 transitions. [2019-12-27 17:38:14,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:38:14,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:38:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:14,681 INFO L225 Difference]: With dead ends: 33436 [2019-12-27 17:38:14,681 INFO L226 Difference]: Without dead ends: 33436 [2019-12-27 17:38:14,681 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-27 17:38:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33436 states. [2019-12-27 17:38:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33436 to 29088. [2019-12-27 17:38:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29088 states. [2019-12-27 17:38:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29088 states to 29088 states and 92511 transitions. [2019-12-27 17:38:15,215 INFO L78 Accepts]: Start accepts. Automaton has 29088 states and 92511 transitions. Word has length 65 [2019-12-27 17:38:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 29088 states and 92511 transitions. [2019-12-27 17:38:15,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:38:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29088 states and 92511 transitions. [2019-12-27 17:38:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:38:15,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:15,249 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-27 17:38:15,249 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-27 17:38:15,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:15,249 INFO L82 PathProgramCache]: Analyzing trace with hash -511059819, now seen corresponding path program 1 times [2019-12-27 17:38:15,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:15,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642295203] [2019-12-27 17:38:15,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:15,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642295203] [2019-12-27 17:38:15,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:15,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:38:15,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035360856] [2019-12-27 17:38:15,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:15,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:15,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 17:38:15,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:15,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:38:15,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:15,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:15,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:15,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:15,728 INFO L87 Difference]: Start difference. First operand 29088 states and 92511 transitions. Second operand 4 states. [2019-12-27 17:38:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:16,382 INFO L93 Difference]: Finished difference Result 31847 states and 98392 transitions. [2019-12-27 17:38:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:38:16,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 17:38:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:16,424 INFO L225 Difference]: With dead ends: 31847 [2019-12-27 17:38:16,425 INFO L226 Difference]: Without dead ends: 31847 [2019-12-27 17:38:16,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:38:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31847 states. [2019-12-27 17:38:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31847 to 22228. [2019-12-27 17:38:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22228 states. [2019-12-27 17:38:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22228 states to 22228 states and 69209 transitions. [2019-12-27 17:38:16,818 INFO L78 Accepts]: Start accepts. Automaton has 22228 states and 69209 transitions. Word has length 66 [2019-12-27 17:38:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:16,818 INFO L462 AbstractCegarLoop]: Abstraction has 22228 states and 69209 transitions. [2019-12-27 17:38:16,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22228 states and 69209 transitions. [2019-12-27 17:38:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:16,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:16,839 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-27 17:38:16,839 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-27 17:38:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-27 17:38:16,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:16,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605186743] [2019-12-27 17:38:16,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:17,006 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-27 17:38:17,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605186743] [2019-12-27 17:38:17,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:17,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:17,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297260927] [2019-12-27 17:38:17,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:17,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:17,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 17:38:17,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:17,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:38:17,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:38:17,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:38:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:38:17,343 INFO L87 Difference]: Start difference. First operand 22228 states and 69209 transitions. Second operand 12 states. [2019-12-27 17:38:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:19,723 INFO L93 Difference]: Finished difference Result 39535 states and 122802 transitions. [2019-12-27 17:38:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:38:19,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 17:38:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:19,769 INFO L225 Difference]: With dead ends: 39535 [2019-12-27 17:38:19,769 INFO L226 Difference]: Without dead ends: 31774 [2019-12-27 17:38:19,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:38:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31774 states. [2019-12-27 17:38:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31774 to 22930. [2019-12-27 17:38:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22930 states. [2019-12-27 17:38:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22930 states to 22930 states and 71133 transitions. [2019-12-27 17:38:20,189 INFO L78 Accepts]: Start accepts. Automaton has 22930 states and 71133 transitions. Word has length 67 [2019-12-27 17:38:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:20,189 INFO L462 AbstractCegarLoop]: Abstraction has 22930 states and 71133 transitions. [2019-12-27 17:38:20,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:38:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22930 states and 71133 transitions. [2019-12-27 17:38:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:20,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:20,214 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-27 17:38:20,214 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-27 17:38:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:20,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1908292690, now seen corresponding path program 2 times [2019-12-27 17:38:20,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:20,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815007418] [2019-12-27 17:38:20,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:20,414 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-27 17:38:20,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815007418] [2019-12-27 17:38:20,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:20,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:38:20,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849202783] [2019-12-27 17:38:20,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:20,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:21,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 17:38:21,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:21,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:38:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:38:21,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:38:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:38:21,300 INFO L87 Difference]: Start difference. First operand 22930 states and 71133 transitions. Second operand 13 states. [2019-12-27 17:38:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:23,635 INFO L93 Difference]: Finished difference Result 47590 states and 146320 transitions. [2019-12-27 17:38:23,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:38:23,636 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 17:38:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:23,696 INFO L225 Difference]: With dead ends: 47590 [2019-12-27 17:38:23,696 INFO L226 Difference]: Without dead ends: 42474 [2019-12-27 17:38:23,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:38:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42474 states. [2019-12-27 17:38:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42474 to 23505. [2019-12-27 17:38:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23505 states. [2019-12-27 17:38:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23505 states to 23505 states and 72625 transitions. [2019-12-27 17:38:24,220 INFO L78 Accepts]: Start accepts. Automaton has 23505 states and 72625 transitions. Word has length 67 [2019-12-27 17:38:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:24,220 INFO L462 AbstractCegarLoop]: Abstraction has 23505 states and 72625 transitions. [2019-12-27 17:38:24,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:38:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 23505 states and 72625 transitions. [2019-12-27 17:38:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:24,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:24,244 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-27 17:38:24,245 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-27 17:38:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 993635084, now seen corresponding path program 3 times [2019-12-27 17:38:24,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:24,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928341261] [2019-12-27 17:38:24,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:24,397 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-27 17:38:24,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928341261] [2019-12-27 17:38:24,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:24,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:24,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851129867] [2019-12-27 17:38:24,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:24,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:24,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 17:38:24,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:24,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:25,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 17:38:25,431 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 17:38:25,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:25,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:38:25,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:38:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:38:25,433 INFO L87 Difference]: Start difference. First operand 23505 states and 72625 transitions. Second operand 19 states. [2019-12-27 17:38:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:29,531 INFO L93 Difference]: Finished difference Result 36697 states and 113049 transitions. [2019-12-27 17:38:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:38:29,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 17:38:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:29,575 INFO L225 Difference]: With dead ends: 36697 [2019-12-27 17:38:29,575 INFO L226 Difference]: Without dead ends: 32713 [2019-12-27 17:38:29,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:38:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32713 states. [2019-12-27 17:38:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32713 to 22953. [2019-12-27 17:38:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22953 states. [2019-12-27 17:38:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22953 states to 22953 states and 70991 transitions. [2019-12-27 17:38:30,002 INFO L78 Accepts]: Start accepts. Automaton has 22953 states and 70991 transitions. Word has length 67 [2019-12-27 17:38:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:30,002 INFO L462 AbstractCegarLoop]: Abstraction has 22953 states and 70991 transitions. [2019-12-27 17:38:30,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:38:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22953 states and 70991 transitions. [2019-12-27 17:38:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:30,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:30,024 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-27 17:38:30,024 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-27 17:38:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 4 times [2019-12-27 17:38:30,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:30,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094608679] [2019-12-27 17:38:30,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:30,190 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-27 17:38:30,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094608679] [2019-12-27 17:38:30,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:30,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:30,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446868956] [2019-12-27 17:38:30,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:30,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:30,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 17:38:30,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:30,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:38:30,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:38:30,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:38:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:38:30,596 INFO L87 Difference]: Start difference. First operand 22953 states and 70991 transitions. Second operand 15 states. [2019-12-27 17:38:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:32,734 INFO L93 Difference]: Finished difference Result 46515 states and 144125 transitions. [2019-12-27 17:38:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 17:38:32,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 17:38:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:32,799 INFO L225 Difference]: With dead ends: 46515 [2019-12-27 17:38:32,800 INFO L226 Difference]: Without dead ends: 44045 [2019-12-27 17:38:32,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:38:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44045 states. [2019-12-27 17:38:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44045 to 25755. [2019-12-27 17:38:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25755 states. [2019-12-27 17:38:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25755 states to 25755 states and 79726 transitions. [2019-12-27 17:38:33,397 INFO L78 Accepts]: Start accepts. Automaton has 25755 states and 79726 transitions. Word has length 67 [2019-12-27 17:38:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:33,397 INFO L462 AbstractCegarLoop]: Abstraction has 25755 states and 79726 transitions. [2019-12-27 17:38:33,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:38:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25755 states and 79726 transitions. [2019-12-27 17:38:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:33,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:33,427 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-27 17:38:33,427 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-27 17:38:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash 147134104, now seen corresponding path program 5 times [2019-12-27 17:38:33,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:33,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079745415] [2019-12-27 17:38:33,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:33,614 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-27 17:38:33,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079745415] [2019-12-27 17:38:33,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:33,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:33,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628977168] [2019-12-27 17:38:33,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:33,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:34,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 677 transitions. [2019-12-27 17:38:34,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:34,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:38:34,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:38:34,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:38:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:38:34,712 INFO L87 Difference]: Start difference. First operand 25755 states and 79726 transitions. Second operand 14 states. [2019-12-27 17:38:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:37,098 INFO L93 Difference]: Finished difference Result 37227 states and 114841 transitions. [2019-12-27 17:38:37,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:38:37,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 17:38:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:37,147 INFO L225 Difference]: With dead ends: 37227 [2019-12-27 17:38:37,147 INFO L226 Difference]: Without dead ends: 35341 [2019-12-27 17:38:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:38:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35341 states. [2019-12-27 17:38:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35341 to 25979. [2019-12-27 17:38:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25979 states. [2019-12-27 17:38:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25979 states to 25979 states and 80309 transitions. [2019-12-27 17:38:37,619 INFO L78 Accepts]: Start accepts. Automaton has 25979 states and 80309 transitions. Word has length 67 [2019-12-27 17:38:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:37,619 INFO L462 AbstractCegarLoop]: Abstraction has 25979 states and 80309 transitions. [2019-12-27 17:38:37,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:38:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states and 80309 transitions. [2019-12-27 17:38:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:37,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:37,645 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-27 17:38:37,645 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-27 17:38:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1786368232, now seen corresponding path program 6 times [2019-12-27 17:38:37,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:37,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634454013] [2019-12-27 17:38:37,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:38,253 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-27 17:38:38,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634454013] [2019-12-27 17:38:38,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:38,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 17:38:38,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413115920] [2019-12-27 17:38:38,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:38,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:38,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 334 states and 707 transitions. [2019-12-27 17:38:38,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:39,519 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-27 17:38:39,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:39,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 17:38:39,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:39,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 17:38:39,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:40,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:38:40,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 52 times. [2019-12-27 17:38:40,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 17:38:40,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 17:38:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:38:40,615 INFO L87 Difference]: Start difference. First operand 25979 states and 80309 transitions. Second operand 34 states. [2019-12-27 17:38:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:47,037 INFO L93 Difference]: Finished difference Result 51407 states and 154362 transitions. [2019-12-27 17:38:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 17:38:47,038 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 17:38:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:47,110 INFO L225 Difference]: With dead ends: 51407 [2019-12-27 17:38:47,110 INFO L226 Difference]: Without dead ends: 51240 [2019-12-27 17:38:47,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 22 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=509, Invalid=4047, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 17:38:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51240 states. [2019-12-27 17:38:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51240 to 25905. [2019-12-27 17:38:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25905 states. [2019-12-27 17:38:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25905 states to 25905 states and 80124 transitions. [2019-12-27 17:38:47,726 INFO L78 Accepts]: Start accepts. Automaton has 25905 states and 80124 transitions. Word has length 67 [2019-12-27 17:38:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:47,726 INFO L462 AbstractCegarLoop]: Abstraction has 25905 states and 80124 transitions. [2019-12-27 17:38:47,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 17:38:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 25905 states and 80124 transitions. [2019-12-27 17:38:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:47,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:47,755 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-27 17:38:47,755 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-27 17:38:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2012931056, now seen corresponding path program 1 times [2019-12-27 17:38:47,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:47,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500478170] [2019-12-27 17:38:47,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:47,794 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-27 17:38:47,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500478170] [2019-12-27 17:38:47,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:47,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:38:47,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801307512] [2019-12-27 17:38:47,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:47,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:48,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 284 states and 579 transitions. [2019-12-27 17:38:48,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:48,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:38:48,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:38:48,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:38:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:48,392 INFO L87 Difference]: Start difference. First operand 25905 states and 80124 transitions. Second operand 4 states. [2019-12-27 17:38:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:48,582 INFO L93 Difference]: Finished difference Result 28859 states and 84576 transitions. [2019-12-27 17:38:48,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:38:48,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 17:38:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:48,620 INFO L225 Difference]: With dead ends: 28859 [2019-12-27 17:38:48,620 INFO L226 Difference]: Without dead ends: 28756 [2019-12-27 17:38:48,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:38:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28756 states. [2019-12-27 17:38:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28756 to 21817. [2019-12-27 17:38:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21817 states. [2019-12-27 17:38:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21817 states to 21817 states and 64703 transitions. [2019-12-27 17:38:48,999 INFO L78 Accepts]: Start accepts. Automaton has 21817 states and 64703 transitions. Word has length 67 [2019-12-27 17:38:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:49,000 INFO L462 AbstractCegarLoop]: Abstraction has 21817 states and 64703 transitions. [2019-12-27 17:38:49,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:38:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 21817 states and 64703 transitions. [2019-12-27 17:38:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:49,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:49,022 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-27 17:38:49,022 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-27 17:38:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1732230978, now seen corresponding path program 7 times [2019-12-27 17:38:49,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:49,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650284086] [2019-12-27 17:38:49,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:38:49,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650284086] [2019-12-27 17:38:49,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:49,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:38:49,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186479256] [2019-12-27 17:38:49,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:49,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:49,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 631 transitions. [2019-12-27 17:38:49,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:49,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 17:38:49,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:38:49,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:49,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:38:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:38:49,906 INFO L87 Difference]: Start difference. First operand 21817 states and 64703 transitions. Second operand 17 states. [2019-12-27 17:38:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:38:57,035 INFO L93 Difference]: Finished difference Result 96014 states and 287276 transitions. [2019-12-27 17:38:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 17:38:57,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 17:38:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:38:57,120 INFO L225 Difference]: With dead ends: 96014 [2019-12-27 17:38:57,120 INFO L226 Difference]: Without dead ends: 62465 [2019-12-27 17:38:57,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3991 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1546, Invalid=9584, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 17:38:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62465 states. [2019-12-27 17:38:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62465 to 21699. [2019-12-27 17:38:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21699 states. [2019-12-27 17:38:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21699 states to 21699 states and 64779 transitions. [2019-12-27 17:38:57,739 INFO L78 Accepts]: Start accepts. Automaton has 21699 states and 64779 transitions. Word has length 67 [2019-12-27 17:38:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:38:57,739 INFO L462 AbstractCegarLoop]: Abstraction has 21699 states and 64779 transitions. [2019-12-27 17:38:57,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:38:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21699 states and 64779 transitions. [2019-12-27 17:38:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:38:57,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:38:57,761 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-27 17:38:57,761 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-27 17:38:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:38:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash -300630794, now seen corresponding path program 8 times [2019-12-27 17:38:57,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:38:57,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596732290] [2019-12-27 17:38:57,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:38:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:38:58,175 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-27 17:38:58,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596732290] [2019-12-27 17:38:58,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:38:58,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:38:58,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514836646] [2019-12-27 17:38:58,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:38:58,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:38:58,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 17:38:58,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:38:58,958 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-27 17:38:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:38:59,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 17:38:59,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 17:38:59,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:38:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 17:38:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-12-27 17:38:59,232 INFO L87 Difference]: Start difference. First operand 21699 states and 64779 transitions. Second operand 25 states. [2019-12-27 17:39:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:39:09,401 INFO L93 Difference]: Finished difference Result 49409 states and 145388 transitions. [2019-12-27 17:39:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 17:39:09,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 17:39:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:39:09,452 INFO L225 Difference]: With dead ends: 49409 [2019-12-27 17:39:09,452 INFO L226 Difference]: Without dead ends: 38720 [2019-12-27 17:39:09,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=724, Invalid=4388, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 17:39:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38720 states. [2019-12-27 17:39:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38720 to 23125. [2019-12-27 17:39:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23125 states. [2019-12-27 17:39:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23125 states to 23125 states and 69224 transitions. [2019-12-27 17:39:09,926 INFO L78 Accepts]: Start accepts. Automaton has 23125 states and 69224 transitions. Word has length 67 [2019-12-27 17:39:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:39:09,926 INFO L462 AbstractCegarLoop]: Abstraction has 23125 states and 69224 transitions. [2019-12-27 17:39:09,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 17:39:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23125 states and 69224 transitions. [2019-12-27 17:39:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:39:09,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:39:09,947 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-27 17:39:09,947 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-27 17:39:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:39:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1507186580, now seen corresponding path program 9 times [2019-12-27 17:39:09,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:39:09,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708949892] [2019-12-27 17:39:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:39:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:39:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:39:10,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:39:10,057 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:39:10,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1570~0.base_23|)) (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 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) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1570~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1570~0.base_23|) |v_ULTIMATE.start_main_~#t1570~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t1570~0.offset_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1570~0.base_23| 4)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= 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) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1570~0.base_23| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1570~0.base_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~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_#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|, ULTIMATE.start_main_~#t1571~0.base=|v_ULTIMATE.start_main_~#t1571~0.base_19|, ~__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_~#t1572~0.base=|v_ULTIMATE.start_main_~#t1572~0.base_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_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, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1570~0.offset=|v_ULTIMATE.start_main_~#t1570~0.offset_17|, ~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, ULTIMATE.start_main_~#t1572~0.offset=|v_ULTIMATE.start_main_~#t1572~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1570~0.base=|v_ULTIMATE.start_main_~#t1570~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #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, ULTIMATE.start_main_~#t1571~0.offset=|v_ULTIMATE.start_main_~#t1571~0.offset_12|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1571~0.base, ~__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_~#t1572~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1570~0.offset, ~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, ULTIMATE.start_main_~#t1572~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1570~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1571~0.offset] because there is no mapped edge [2019-12-27 17:39:10,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1571~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1571~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1571~0.base_11|) |v_ULTIMATE.start_main_~#t1571~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1571~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1571~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1571~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1571~0.base_11|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1571~0.base_11| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#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|, ULTIMATE.start_main_~#t1571~0.base=|v_ULTIMATE.start_main_~#t1571~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1571~0.offset=|v_ULTIMATE.start_main_~#t1571~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1571~0.base, #length, ULTIMATE.start_main_~#t1571~0.offset] because there is no mapped edge [2019-12-27 17:39:10,062 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-27 17:39:10,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1619871676 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1619871676 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1619871676| ~z$w_buff1~0_In1619871676) (not .cse1)) (and (= ~z~0_In1619871676 |P1Thread1of1ForFork2_#t~ite9_Out1619871676|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1619871676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1619871676, ~z$w_buff1~0=~z$w_buff1~0_In1619871676, ~z~0=~z~0_In1619871676} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1619871676|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1619871676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1619871676, ~z$w_buff1~0=~z$w_buff1~0_In1619871676, ~z~0=~z~0_In1619871676} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 17:39:10,064 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-27 17:39:10,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1572~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1572~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1572~0.base_13|) |v_ULTIMATE.start_main_~#t1572~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1572~0.base_13| 1) |v_#valid_36|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1572~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1572~0.offset_11| 0) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1572~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t1572~0.base_13| 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|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1572~0.offset=|v_ULTIMATE.start_main_~#t1572~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1572~0.base=|v_ULTIMATE.start_main_~#t1572~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1572~0.offset, #length, ULTIMATE.start_main_~#t1572~0.base] because there is no mapped edge [2019-12-27 17:39:10,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In276248816 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In276248816 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out276248816| ~z$w_buff0_used~0_In276248816) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out276248816| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In276248816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In276248816, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out276248816|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In276248816} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:39:10,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1426865004 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1426865004 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1426865004 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1426865004 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1426865004| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1426865004 |P1Thread1of1ForFork2_#t~ite12_Out1426865004|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1426865004, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1426865004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1426865004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1426865004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1426865004, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1426865004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1426865004, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1426865004|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1426865004} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:39:10,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1855930481 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1855930481 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1855930481| ~z$r_buff0_thd2~0_In1855930481) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1855930481| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1855930481, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1855930481} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1855930481, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1855930481|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1855930481} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 17:39:10,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In156721938 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In156721938 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In156721938 |P0Thread1of1ForFork1_#t~ite5_Out156721938|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out156721938| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In156721938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In156721938} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out156721938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In156721938, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In156721938} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:39:10,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-283491662 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-283491662 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-283491662 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-283491662 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-283491662 |P0Thread1of1ForFork1_#t~ite6_Out-283491662|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-283491662| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-283491662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283491662, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-283491662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-283491662, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-283491662|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-283491662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283491662, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-283491662} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:39:10,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1558477640 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1558477640 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1558477640 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1558477640 ~z$r_buff0_thd1~0_Out-1558477640) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1558477640, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1558477640} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1558477640, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1558477640|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1558477640} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:39:10,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2002630720 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-2002630720 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-2002630720 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2002630720 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-2002630720| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-2002630720| ~z$r_buff1_thd1~0_In-2002630720) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2002630720} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2002630720|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2002630720, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2002630720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2002630720, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2002630720} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:39:10,070 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-27 17:39:10,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-20815847 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-20815847 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-20815847 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-20815847 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-20815847|)) (and (= ~z$r_buff1_thd2~0_In-20815847 |P1Thread1of1ForFork2_#t~ite14_Out-20815847|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-20815847, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-20815847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-20815847, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-20815847} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-20815847, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-20815847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-20815847, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-20815847|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-20815847} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:39:10,071 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-27 17:39:10,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1539498019 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1539498019 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1539498019 256) 0)) (= (mod ~z$w_buff0_used~0_In-1539498019 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-1539498019 256)) .cse0))) (= ~z$w_buff0_used~0_In-1539498019 |P2Thread1of1ForFork0_#t~ite26_Out-1539498019|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1539498019| |P2Thread1of1ForFork0_#t~ite26_Out-1539498019|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1539498019| ~z$w_buff0_used~0_In-1539498019) (= |P2Thread1of1ForFork0_#t~ite26_In-1539498019| |P2Thread1of1ForFork0_#t~ite26_Out-1539498019|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1539498019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1539498019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539498019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1539498019, ~weak$$choice2~0=~weak$$choice2~0_In-1539498019} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1539498019|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1539498019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1539498019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539498019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1539498019, ~weak$$choice2~0=~weak$$choice2~0_In-1539498019} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 17:39:10,075 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-27 17:39:10,077 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-27 17:39:10,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out717642558| |P2Thread1of1ForFork0_#t~ite38_Out717642558|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In717642558 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In717642558 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out717642558| ~z~0_In717642558) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In717642558 |P2Thread1of1ForFork0_#t~ite38_Out717642558|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In717642558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717642558, ~z$w_buff1~0=~z$w_buff1~0_In717642558, ~z~0=~z~0_In717642558} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out717642558|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out717642558|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In717642558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In717642558, ~z$w_buff1~0=~z$w_buff1~0_In717642558, ~z~0=~z~0_In717642558} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:39:10,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1571536244 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1571536244 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1571536244 |P2Thread1of1ForFork0_#t~ite40_Out1571536244|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1571536244|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1571536244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1571536244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1571536244, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1571536244|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1571536244} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 17:39:10,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In394485828 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In394485828 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In394485828 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In394485828 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out394485828| ~z$w_buff1_used~0_In394485828) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite41_Out394485828| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In394485828, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In394485828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In394485828, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In394485828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In394485828, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In394485828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In394485828, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In394485828, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out394485828|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 17:39:10,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1272620357 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1272620357 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1272620357| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1272620357| ~z$r_buff0_thd3~0_In1272620357)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1272620357, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1272620357} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1272620357, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1272620357, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1272620357|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 17:39:10,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-755176662 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-755176662 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-755176662 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-755176662 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-755176662 |P2Thread1of1ForFork0_#t~ite43_Out-755176662|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-755176662| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755176662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755176662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-755176662|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755176662, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755176662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755176662, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755176662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 17:39:10,080 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-27 17:39:10,080 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-27 17:39:10,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-721567767| |ULTIMATE.start_main_#t~ite47_Out-721567767|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-721567767 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-721567767 256) 0))) (or (and (= ~z$w_buff1~0_In-721567767 |ULTIMATE.start_main_#t~ite47_Out-721567767|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~z~0_In-721567767 |ULTIMATE.start_main_#t~ite47_Out-721567767|) (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-721567767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-721567767, ~z$w_buff1~0=~z$w_buff1~0_In-721567767, ~z~0=~z~0_In-721567767} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-721567767, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-721567767|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-721567767, ~z$w_buff1~0=~z$w_buff1~0_In-721567767, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-721567767|, ~z~0=~z~0_In-721567767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:39:10,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1740821713 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1740821713 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1740821713| ~z$w_buff0_used~0_In1740821713) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1740821713| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1740821713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1740821713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1740821713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1740821713, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1740821713|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:39:10,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1242822770 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1242822770 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1242822770 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1242822770 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1242822770 |ULTIMATE.start_main_#t~ite50_Out1242822770|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite50_Out1242822770| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1242822770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1242822770, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1242822770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242822770} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1242822770|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1242822770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1242822770, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1242822770, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1242822770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:39:10,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-603976258 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-603976258 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-603976258|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-603976258 |ULTIMATE.start_main_#t~ite51_Out-603976258|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-603976258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-603976258, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-603976258|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603976258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:39:10,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-760269232 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-760269232 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-760269232 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-760269232 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-760269232| ~z$r_buff1_thd0~0_In-760269232) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-760269232| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-760269232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760269232, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-760269232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-760269232} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-760269232|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-760269232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-760269232, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-760269232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-760269232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:39:10,084 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-27 17:39:10,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:39:10 BasicIcfg [2019-12-27 17:39:10,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:39:10,182 INFO L168 Benchmark]: Toolchain (without parser) took 156049.52 ms. Allocated memory was 137.4 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,184 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.80 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 153.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,189 INFO L168 Benchmark]: Boogie Preprocessor took 43.59 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 148.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,189 INFO L168 Benchmark]: RCFGBuilder took 885.31 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,189 INFO L168 Benchmark]: TraceAbstraction took 154183.34 ms. Allocated memory was 202.4 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 97.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:39:10,193 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.80 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 153.9 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.59 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 148.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.31 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 98.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154183.34 ms. Allocated memory was 202.4 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 97.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 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(&t1570, ((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(&t1571, ((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(&t1572, ((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] [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 [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 [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 [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 [\result={0:0}, __unbuffered_cnt=2, __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=0, z$w_buff1=0, z$w_buff1_used=0] [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 [\result={0:0}, __unbuffered_cnt=2, __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=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 [\result={0:0}, __unbuffered_cnt=2, __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=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 [\result={0:0}, __unbuffered_cnt=2, __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=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 [\result={0:0}, __unbuffered_cnt=2, __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=0, z$w_buff1=0, z$w_buff1_used=0] [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 [\result={0:0}, __unbuffered_cnt=2, __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_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 [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: 153.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 62.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7825 SDtfs, 12291 SDslu, 38604 SDs, 0 SdLazy, 33251 SolverSat, 751 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 717 GetRequests, 125 SyntacticMatches, 79 SemanticMatches, 513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7360 ImplicationChecksByTransitivity, 13.9s 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: 44.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 397124 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1336 ConstructedInterpolants, 0 QuantifiedInterpolants, 324992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...