/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:47:50,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:47:50,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:47:50,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:47:50,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:47:50,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:47:50,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:47:50,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:47:50,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:47:50,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:47:50,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:47:50,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:47:50,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:47:50,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:47:50,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:47:50,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:47:50,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:47:50,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:47:50,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:47:50,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:47:50,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:47:50,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:47:50,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:47:50,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:47:50,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:47:50,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:47:50,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:47:50,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:47:50,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:47:50,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:47:50,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:47:50,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:47:50,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:47:50,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:47:50,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:47:50,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:47:50,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:47:50,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:47:50,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:47:50,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:47:50,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:47:50,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:47:50,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:47:50,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:47:50,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:47:50,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:47:50,888 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:47:50,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:47:50,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:47:50,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:47:50,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:47:50,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:47:50,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:47:50,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:47:50,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:47:50,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:47:50,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:47:50,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:47:50,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:47:50,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:47:50,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:47:50,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:47:50,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:47:50,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:47:50,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:47:50,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:47:50,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:47:50,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:47:50,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:47:50,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:47:50,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:47:51,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:47:51,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:47:51,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:47:51,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:47:51,207 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:47:51,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-18 17:47:51,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27477770d/27b7f1ee9e4c4821a6ed85f7449d6b3d/FLAG2ee768567 [2019-12-18 17:47:51,869 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:47:51,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-18 17:47:51,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27477770d/27b7f1ee9e4c4821a6ed85f7449d6b3d/FLAG2ee768567 [2019-12-18 17:47:52,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27477770d/27b7f1ee9e4c4821a6ed85f7449d6b3d [2019-12-18 17:47:52,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:47:52,115 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:47:52,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:47:52,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:47:52,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:47:52,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52, skipping insertion in model container [2019-12-18 17:47:52,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:47:52,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:47:52,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:47:52,686 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:47:52,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:47:52,868 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:47:52,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52 WrapperNode [2019-12-18 17:47:52,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:47:52,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:47:52,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:47:52,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:47:52,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:47:52,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:47:52,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:47:52,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:47:52,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... [2019-12-18 17:47:52,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:47:52,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:47:52,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:47:52,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:47:52,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:47:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:47:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:47:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:47:53,049 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:47:53,049 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:47:53,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:47:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:47:53,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:47:53,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:47:53,052 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:47:53,794 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:47:53,795 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:47:53,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:47:53 BoogieIcfgContainer [2019-12-18 17:47:53,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:47:53,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:47:53,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:47:53,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:47:53,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:47:52" (1/3) ... [2019-12-18 17:47:53,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:47:53, skipping insertion in model container [2019-12-18 17:47:53,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:47:52" (2/3) ... [2019-12-18 17:47:53,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3c88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:47:53, skipping insertion in model container [2019-12-18 17:47:53,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:47:53" (3/3) ... [2019-12-18 17:47:53,805 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-18 17:47:53,816 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:47:53,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:47:53,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:47:53,825 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:47:53,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,909 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,909 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:47:53,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:47:53,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:47:53,990 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:47:53,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:47:53,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:47:53,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:47:53,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:47:53,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:47:53,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:47:54,009 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 17:47:54,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:47:54,107 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:47:54,107 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:47:54,126 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:47:54,156 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 17:47:54,219 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 17:47:54,219 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:47:54,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:47:54,255 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:47:54,256 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:48:00,031 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:48:00,157 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:48:00,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 17:48:00,530 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 17:48:00,535 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 17:48:18,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 17:48:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 17:48:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:48:18,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:18,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:48:18,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 17:48:18,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:18,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 17:48:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876566353] [2019-12-18 17:48:18,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:18,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:48:18,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931707045] [2019-12-18 17:48:18,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:18,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:18,721 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 17:48:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:22,690 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 17:48:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:22,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:48:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:23,311 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 17:48:23,311 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 17:48:23,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 17:48:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 17:48:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 17:48:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 17:48:30,513 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 17:48:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:30,513 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 17:48:30,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 17:48:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:48:30,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:30,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:30,518 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 17:48:30,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:30,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 17:48:30,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:30,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279896439] [2019-12-18 17:48:30,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:30,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:30,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994682901] [2019-12-18 17:48:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:48:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:48:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:30,606 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 17:48:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:35,344 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 17:48:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:48:35,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:48:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:36,051 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 17:48:36,051 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 17:48:36,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 17:48:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 17:48:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 17:48:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 17:48:51,645 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 17:48:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:51,645 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 17:48:51,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:48:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 17:48:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:48:51,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:51,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:51,652 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 17:48:51,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:51,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 17:48:51,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:51,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783700110] [2019-12-18 17:48:51,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:51,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:48:51,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595505515] [2019-12-18 17:48:51,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:48:51,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:48:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:51,736 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 17:48:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:51,869 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 17:48:51,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:48:51,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:48:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:51,945 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 17:48:51,946 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 17:48:51,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:48:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 17:48:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 17:48:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 17:48:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 17:48:52,572 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 17:48:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:52,572 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 17:48:52,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:48:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 17:48:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:48:52,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:52,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:52,576 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 17:48:52,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:52,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 17:48:52,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:52,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447458164] [2019-12-18 17:48:52,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:52,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:52,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213687615] [2019-12-18 17:48:52,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:48:52,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:48:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:48:52,665 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 17:48:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:53,153 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 17:48:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:48:53,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 17:48:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:53,224 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 17:48:53,225 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 17:48:53,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:48:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 17:48:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 17:48:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 17:48:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 17:48:55,209 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 17:48:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:55,210 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 17:48:55,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:48:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 17:48:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:48:55,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:55,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:55,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 17:48:55,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:55,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 17:48:55,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:55,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979600534] [2019-12-18 17:48:55,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:55,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:48:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790839240] [2019-12-18 17:48:55,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:48:55,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:48:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:55,345 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 17:48:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:56,268 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 17:48:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:48:56,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:48:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:56,364 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 17:48:56,364 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 17:48:56,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:48:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 17:48:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 17:48:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 17:48:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 17:48:59,448 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 17:48:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:59,449 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 17:48:59,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:48:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 17:48:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:48:59,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:59,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:59,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 17:48:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:59,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 17:48:59,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:59,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107725473] [2019-12-18 17:48:59,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:59,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:48:59,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034301583] [2019-12-18 17:48:59,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:48:59,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:59,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:48:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:59,528 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 17:48:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:48:59,596 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 17:48:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:48:59,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:48:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:48:59,618 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 17:48:59,618 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 17:48:59,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:48:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 17:48:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 17:48:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 17:48:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 17:48:59,860 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 17:48:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:48:59,860 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 17:48:59,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:48:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 17:48:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:48:59,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:48:59,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:48:59,874 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:48:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:48:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 17:48:59,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:48:59,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616744329] [2019-12-18 17:48:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:48:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:48:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:48:59,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616744329] [2019-12-18 17:48:59,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:48:59,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:48:59,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982114586] [2019-12-18 17:48:59,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:48:59,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:48:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:48:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:48:59,983 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 17:49:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:00,547 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 17:49:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:49:00,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:49:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:00,579 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 17:49:00,579 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 17:49:00,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:49:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 17:49:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 17:49:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 17:49:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 17:49:00,863 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 17:49:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:00,863 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 17:49:00,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:49:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 17:49:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:49:00,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:00,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:00,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 17:49:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:00,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903559069] [2019-12-18 17:49:00,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:01,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903559069] [2019-12-18 17:49:01,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:01,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:01,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123392849] [2019-12-18 17:49:01,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:49:01,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:49:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:49:01,035 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-18 17:49:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:02,684 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-18 17:49:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:49:02,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 17:49:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:02,719 INFO L225 Difference]: With dead ends: 24561 [2019-12-18 17:49:02,719 INFO L226 Difference]: Without dead ends: 24561 [2019-12-18 17:49:02,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:49:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-18 17:49:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-18 17:49:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-18 17:49:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-18 17:49:03,023 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-18 17:49:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:03,023 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-18 17:49:03,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:49:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-18 17:49:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:49:03,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:03,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:03,042 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-18 17:49:03,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:03,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541427735] [2019-12-18 17:49:03,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:03,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541427735] [2019-12-18 17:49:03,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:03,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:49:03,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924769445] [2019-12-18 17:49:03,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:49:03,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:49:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:49:03,165 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-18 17:49:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:04,226 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-18 17:49:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:49:04,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:49:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:04,263 INFO L225 Difference]: With dead ends: 24299 [2019-12-18 17:49:04,263 INFO L226 Difference]: Without dead ends: 24299 [2019-12-18 17:49:04,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:49:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-18 17:49:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-18 17:49:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 17:49:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 17:49:04,555 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 17:49:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:04,556 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 17:49:04,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:49:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 17:49:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:49:04,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:04,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:04,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 17:49:04,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:04,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8328902] [2019-12-18 17:49:04,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:04,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8328902] [2019-12-18 17:49:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:04,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:49:04,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203613058] [2019-12-18 17:49:04,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:49:04,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:49:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:04,643 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-18 17:49:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:04,721 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-18 17:49:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:49:04,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 17:49:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:04,744 INFO L225 Difference]: With dead ends: 15541 [2019-12-18 17:49:04,744 INFO L226 Difference]: Without dead ends: 15541 [2019-12-18 17:49:04,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-18 17:49:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-18 17:49:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-18 17:49:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-18 17:49:05,198 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-18 17:49:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:05,198 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-18 17:49:05,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:49:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-18 17:49:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:05,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:05,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:05,219 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-18 17:49:05,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:05,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131939576] [2019-12-18 17:49:05,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:05,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131939576] [2019-12-18 17:49:05,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:05,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:49:05,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825691701] [2019-12-18 17:49:05,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:49:05,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:49:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:05,272 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-18 17:49:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:05,390 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-18 17:49:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:05,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:49:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:05,425 INFO L225 Difference]: With dead ends: 22609 [2019-12-18 17:49:05,425 INFO L226 Difference]: Without dead ends: 22609 [2019-12-18 17:49:05,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-18 17:49:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-18 17:49:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 17:49:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-18 17:49:05,715 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-18 17:49:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:05,715 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-18 17:49:05,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:49:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-18 17:49:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:05,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:05,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:05,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-18 17:49:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:05,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989140196] [2019-12-18 17:49:05,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989140196] [2019-12-18 17:49:05,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:05,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:49:05,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115724474] [2019-12-18 17:49:05,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:49:05,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:49:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:49:05,824 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 4 states. [2019-12-18 17:49:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:05,993 INFO L93 Difference]: Finished difference Result 31544 states and 98598 transitions. [2019-12-18 17:49:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:49:05,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 17:49:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:06,032 INFO L225 Difference]: With dead ends: 31544 [2019-12-18 17:49:06,032 INFO L226 Difference]: Without dead ends: 15723 [2019-12-18 17:49:06,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15723 states. [2019-12-18 17:49:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15723 to 15723. [2019-12-18 17:49:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-18 17:49:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-18 17:49:06,398 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-18 17:49:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:06,398 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-18 17:49:06,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:49:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-18 17:49:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:06,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:06,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:06,416 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-18 17:49:06,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:06,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411529055] [2019-12-18 17:49:06,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:06,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411529055] [2019-12-18 17:49:06,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:06,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:06,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135219029] [2019-12-18 17:49:06,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:49:06,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:49:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:49:06,523 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-18 17:49:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:06,998 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-18 17:49:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:49:06,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:49:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:07,047 INFO L225 Difference]: With dead ends: 46938 [2019-12-18 17:49:07,047 INFO L226 Difference]: Without dead ends: 33282 [2019-12-18 17:49:07,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:49:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-18 17:49:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-18 17:49:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-18 17:49:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-18 17:49:07,581 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-18 17:49:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:07,581 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-18 17:49:07,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:49:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-18 17:49:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:07,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:07,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:07,609 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-18 17:49:07,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:07,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658470604] [2019-12-18 17:49:07,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:07,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658470604] [2019-12-18 17:49:07,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:07,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:07,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687278502] [2019-12-18 17:49:07,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:49:07,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:49:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:49:07,708 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-18 17:49:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:08,234 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-18 17:49:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:49:08,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:49:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:08,324 INFO L225 Difference]: With dead ends: 51331 [2019-12-18 17:49:08,324 INFO L226 Difference]: Without dead ends: 39815 [2019-12-18 17:49:08,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:49:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-18 17:49:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-18 17:49:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-18 17:49:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-18 17:49:08,838 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-18 17:49:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:08,839 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-18 17:49:08,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:49:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-18 17:49:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:08,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:08,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:08,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-18 17:49:08,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:08,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442240778] [2019-12-18 17:49:08,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:08,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442240778] [2019-12-18 17:49:08,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:08,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:08,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859128121] [2019-12-18 17:49:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:49:08,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:49:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:49:08,982 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-18 17:49:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:09,426 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-18 17:49:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:49:09,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:49:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:09,502 INFO L225 Difference]: With dead ends: 45057 [2019-12-18 17:49:09,502 INFO L226 Difference]: Without dead ends: 40843 [2019-12-18 17:49:09,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:49:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-18 17:49:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-18 17:49:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-18 17:49:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-18 17:49:10,220 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-18 17:49:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:10,221 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-18 17:49:10,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:49:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-18 17:49:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:10,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:10,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:10,248 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-18 17:49:10,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:10,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831976454] [2019-12-18 17:49:10,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831976454] [2019-12-18 17:49:10,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:10,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:49:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572813548] [2019-12-18 17:49:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:49:10,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:49:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:10,332 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-18 17:49:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:11,026 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-18 17:49:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:49:11,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:49:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:11,076 INFO L225 Difference]: With dead ends: 34201 [2019-12-18 17:49:11,076 INFO L226 Difference]: Without dead ends: 34033 [2019-12-18 17:49:11,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:49:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-18 17:49:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-18 17:49:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-18 17:49:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-18 17:49:11,547 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-18 17:49:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:11,548 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-18 17:49:11,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:49:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-18 17:49:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:11,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:11,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:11,578 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 6 times [2019-12-18 17:49:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:11,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767089372] [2019-12-18 17:49:11,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:11,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767089372] [2019-12-18 17:49:11,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:11,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:49:11,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050668430] [2019-12-18 17:49:11,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:49:11,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:49:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:11,671 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-18 17:49:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:12,060 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-18 17:49:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:49:12,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 17:49:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:12,104 INFO L225 Difference]: With dead ends: 30014 [2019-12-18 17:49:12,105 INFO L226 Difference]: Without dead ends: 30014 [2019-12-18 17:49:12,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:49:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-18 17:49:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-18 17:49:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-18 17:49:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-18 17:49:12,561 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-18 17:49:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:12,562 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-18 17:49:12,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:49:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-18 17:49:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:12,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:12,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:12,594 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 7 times [2019-12-18 17:49:12,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:12,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817146060] [2019-12-18 17:49:12,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:12,895 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 17:49:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:12,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817146060] [2019-12-18 17:49:12,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:12,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:12,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722357409] [2019-12-18 17:49:12,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:49:12,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:49:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:49:12,922 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 6 states. [2019-12-18 17:49:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:13,917 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-18 17:49:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:49:13,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 17:49:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:14,021 INFO L225 Difference]: With dead ends: 48040 [2019-12-18 17:49:14,021 INFO L226 Difference]: Without dead ends: 47747 [2019-12-18 17:49:14,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:49:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-18 17:49:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-18 17:49:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-18 17:49:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-18 17:49:14,719 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-18 17:49:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:14,720 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-18 17:49:14,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:49:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-18 17:49:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:49:14,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:14,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] [2019-12-18 17:49:14,761 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 8 times [2019-12-18 17:49:14,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:14,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684726637] [2019-12-18 17:49:14,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:14,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684726637] [2019-12-18 17:49:14,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:14,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:49:14,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131902755] [2019-12-18 17:49:14,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:49:14,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:14,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:49:14,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:14,865 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-18 17:49:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:15,029 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-18 17:49:15,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:15,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:49:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:15,104 INFO L225 Difference]: With dead ends: 36218 [2019-12-18 17:49:15,104 INFO L226 Difference]: Without dead ends: 36218 [2019-12-18 17:49:15,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-18 17:49:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-18 17:49:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-18 17:49:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-18 17:49:16,078 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-18 17:49:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:16,079 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-18 17:49:16,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:49:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-18 17:49:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:49:16,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:16,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:16,122 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-18 17:49:16,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:16,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719814290] [2019-12-18 17:49:16,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:16,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719814290] [2019-12-18 17:49:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:49:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467934418] [2019-12-18 17:49:16,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:49:16,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:49:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:49:16,217 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-18 17:49:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:16,788 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-18 17:49:16,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:49:16,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 17:49:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:16,874 INFO L225 Difference]: With dead ends: 33466 [2019-12-18 17:49:16,875 INFO L226 Difference]: Without dead ends: 33466 [2019-12-18 17:49:16,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:49:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-18 17:49:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-18 17:49:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-18 17:49:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-18 17:49:17,776 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-18 17:49:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:17,777 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-18 17:49:17,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:49:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-18 17:49:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:49:17,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:17,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:17,828 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:17,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-18 17:49:17,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:17,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232069622] [2019-12-18 17:49:17,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:17,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232069622] [2019-12-18 17:49:17,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:17,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:49:17,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570318333] [2019-12-18 17:49:17,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:49:17,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:49:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:17,898 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 3 states. [2019-12-18 17:49:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:18,052 INFO L93 Difference]: Finished difference Result 23388 states and 72333 transitions. [2019-12-18 17:49:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:18,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:49:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:18,121 INFO L225 Difference]: With dead ends: 23388 [2019-12-18 17:49:18,121 INFO L226 Difference]: Without dead ends: 23388 [2019-12-18 17:49:18,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2019-12-18 17:49:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 22384. [2019-12-18 17:49:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2019-12-18 17:49:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 69136 transitions. [2019-12-18 17:49:18,765 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 69136 transitions. Word has length 65 [2019-12-18 17:49:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:18,766 INFO L462 AbstractCegarLoop]: Abstraction has 22384 states and 69136 transitions. [2019-12-18 17:49:18,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:49:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 69136 transitions. [2019-12-18 17:49:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:18,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:18,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:18,802 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-18 17:49:18,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:18,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332984745] [2019-12-18 17:49:18,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:18,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332984745] [2019-12-18 17:49:18,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:18,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:49:18,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825589307] [2019-12-18 17:49:18,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:49:18,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:18,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:49:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:49:18,917 INFO L87 Difference]: Start difference. First operand 22384 states and 69136 transitions. Second operand 8 states. [2019-12-18 17:49:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:21,402 INFO L93 Difference]: Finished difference Result 36775 states and 110702 transitions. [2019-12-18 17:49:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:49:21,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 17:49:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:21,454 INFO L225 Difference]: With dead ends: 36775 [2019-12-18 17:49:21,454 INFO L226 Difference]: Without dead ends: 36503 [2019-12-18 17:49:21,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:49:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2019-12-18 17:49:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 24201. [2019-12-18 17:49:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24201 states. [2019-12-18 17:49:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24201 states to 24201 states and 74702 transitions. [2019-12-18 17:49:21,916 INFO L78 Accepts]: Start accepts. Automaton has 24201 states and 74702 transitions. Word has length 66 [2019-12-18 17:49:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:21,917 INFO L462 AbstractCegarLoop]: Abstraction has 24201 states and 74702 transitions. [2019-12-18 17:49:21,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:49:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24201 states and 74702 transitions. [2019-12-18 17:49:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:21,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:21,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:21,946 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-18 17:49:21,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:21,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114924685] [2019-12-18 17:49:21,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:22,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114924685] [2019-12-18 17:49:22,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:22,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:49:22,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590531890] [2019-12-18 17:49:22,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:49:22,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:49:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:49:22,051 INFO L87 Difference]: Start difference. First operand 24201 states and 74702 transitions. Second operand 9 states. [2019-12-18 17:49:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:23,533 INFO L93 Difference]: Finished difference Result 45743 states and 140753 transitions. [2019-12-18 17:49:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:49:23,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 17:49:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:23,588 INFO L225 Difference]: With dead ends: 45743 [2019-12-18 17:49:23,588 INFO L226 Difference]: Without dead ends: 36796 [2019-12-18 17:49:23,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:49:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-18 17:49:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 24806. [2019-12-18 17:49:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-18 17:49:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 76001 transitions. [2019-12-18 17:49:24,043 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 76001 transitions. Word has length 66 [2019-12-18 17:49:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:24,043 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 76001 transitions. [2019-12-18 17:49:24,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:49:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 76001 transitions. [2019-12-18 17:49:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:24,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:24,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:24,069 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 216698061, now seen corresponding path program 3 times [2019-12-18 17:49:24,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:24,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627016525] [2019-12-18 17:49:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:24,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-18 17:49:24,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627016525] [2019-12-18 17:49:24,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:24,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:49:24,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884120665] [2019-12-18 17:49:24,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:49:24,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:49:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:49:24,247 INFO L87 Difference]: Start difference. First operand 24806 states and 76001 transitions. Second operand 11 states. [2019-12-18 17:49:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:25,709 INFO L93 Difference]: Finished difference Result 49982 states and 152918 transitions. [2019-12-18 17:49:25,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 17:49:25,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:49:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:25,765 INFO L225 Difference]: With dead ends: 49982 [2019-12-18 17:49:25,765 INFO L226 Difference]: Without dead ends: 40195 [2019-12-18 17:49:25,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 17:49:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40195 states. [2019-12-18 17:49:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40195 to 23864. [2019-12-18 17:49:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23864 states. [2019-12-18 17:49:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23864 states to 23864 states and 73092 transitions. [2019-12-18 17:49:26,232 INFO L78 Accepts]: Start accepts. Automaton has 23864 states and 73092 transitions. Word has length 66 [2019-12-18 17:49:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:26,232 INFO L462 AbstractCegarLoop]: Abstraction has 23864 states and 73092 transitions. [2019-12-18 17:49:26,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:49:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23864 states and 73092 transitions. [2019-12-18 17:49:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:49:26,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:26,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:26,259 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 4 times [2019-12-18 17:49:26,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724842950] [2019-12-18 17:49:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:26,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724842950] [2019-12-18 17:49:26,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:26,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:49:26,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804643865] [2019-12-18 17:49:26,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:49:26,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:49:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:49:26,341 INFO L87 Difference]: Start difference. First operand 23864 states and 73092 transitions. Second operand 4 states. [2019-12-18 17:49:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:26,520 INFO L93 Difference]: Finished difference Result 27941 states and 85304 transitions. [2019-12-18 17:49:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:26,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:49:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:26,565 INFO L225 Difference]: With dead ends: 27941 [2019-12-18 17:49:26,565 INFO L226 Difference]: Without dead ends: 27941 [2019-12-18 17:49:26,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 17:49:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27941 states. [2019-12-18 17:49:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27941 to 23912. [2019-12-18 17:49:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23912 states. [2019-12-18 17:49:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23912 states to 23912 states and 73418 transitions. [2019-12-18 17:49:26,966 INFO L78 Accepts]: Start accepts. Automaton has 23912 states and 73418 transitions. Word has length 66 [2019-12-18 17:49:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:26,966 INFO L462 AbstractCegarLoop]: Abstraction has 23912 states and 73418 transitions. [2019-12-18 17:49:26,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:49:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 23912 states and 73418 transitions. [2019-12-18 17:49:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:26,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:26,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:26,995 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-18 17:49:26,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:26,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592556666] [2019-12-18 17:49:26,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:27,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592556666] [2019-12-18 17:49:27,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:27,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:49:27,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020972648] [2019-12-18 17:49:27,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:49:27,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:49:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:49:27,285 INFO L87 Difference]: Start difference. First operand 23912 states and 73418 transitions. Second operand 13 states. [2019-12-18 17:49:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:28,187 INFO L93 Difference]: Finished difference Result 27087 states and 82472 transitions. [2019-12-18 17:49:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:49:28,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 17:49:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:28,226 INFO L225 Difference]: With dead ends: 27087 [2019-12-18 17:49:28,227 INFO L226 Difference]: Without dead ends: 26658 [2019-12-18 17:49:28,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:49:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2019-12-18 17:49:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 23658. [2019-12-18 17:49:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23658 states. [2019-12-18 17:49:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23658 states to 23658 states and 72774 transitions. [2019-12-18 17:49:28,840 INFO L78 Accepts]: Start accepts. Automaton has 23658 states and 72774 transitions. Word has length 67 [2019-12-18 17:49:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:28,840 INFO L462 AbstractCegarLoop]: Abstraction has 23658 states and 72774 transitions. [2019-12-18 17:49:28,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:49:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23658 states and 72774 transitions. [2019-12-18 17:49:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:28,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:28,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:28,867 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 750664618, now seen corresponding path program 1 times [2019-12-18 17:49:28,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:28,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959388721] [2019-12-18 17:49:28,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:28,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959388721] [2019-12-18 17:49:28,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:28,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:49:28,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763298011] [2019-12-18 17:49:28,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:49:28,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:49:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:49:28,927 INFO L87 Difference]: Start difference. First operand 23658 states and 72774 transitions. Second operand 4 states. [2019-12-18 17:49:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:29,372 INFO L93 Difference]: Finished difference Result 35745 states and 110826 transitions. [2019-12-18 17:49:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:49:29,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 17:49:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:29,449 INFO L225 Difference]: With dead ends: 35745 [2019-12-18 17:49:29,449 INFO L226 Difference]: Without dead ends: 35745 [2019-12-18 17:49:29,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35745 states. [2019-12-18 17:49:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35745 to 25027. [2019-12-18 17:49:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2019-12-18 17:49:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 77638 transitions. [2019-12-18 17:49:29,942 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 77638 transitions. Word has length 67 [2019-12-18 17:49:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:29,942 INFO L462 AbstractCegarLoop]: Abstraction has 25027 states and 77638 transitions. [2019-12-18 17:49:29,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:49:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 77638 transitions. [2019-12-18 17:49:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:29,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:29,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:29,969 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-18 17:49:29,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:29,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645972965] [2019-12-18 17:49:29,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:30,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645972965] [2019-12-18 17:49:30,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:30,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:49:30,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593162129] [2019-12-18 17:49:30,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:49:30,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:49:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:49:30,221 INFO L87 Difference]: Start difference. First operand 25027 states and 77638 transitions. Second operand 10 states. [2019-12-18 17:49:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:32,918 INFO L93 Difference]: Finished difference Result 44617 states and 137983 transitions. [2019-12-18 17:49:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:49:32,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:49:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:32,987 INFO L225 Difference]: With dead ends: 44617 [2019-12-18 17:49:32,987 INFO L226 Difference]: Without dead ends: 44609 [2019-12-18 17:49:32,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:49:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44609 states. [2019-12-18 17:49:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44609 to 26716. [2019-12-18 17:49:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26716 states. [2019-12-18 17:49:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26716 states to 26716 states and 82150 transitions. [2019-12-18 17:49:33,557 INFO L78 Accepts]: Start accepts. Automaton has 26716 states and 82150 transitions. Word has length 67 [2019-12-18 17:49:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:33,558 INFO L462 AbstractCegarLoop]: Abstraction has 26716 states and 82150 transitions. [2019-12-18 17:49:33,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:49:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 26716 states and 82150 transitions. [2019-12-18 17:49:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:33,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:33,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:33,590 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -3014007, now seen corresponding path program 1 times [2019-12-18 17:49:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:33,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798905759] [2019-12-18 17:49:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:33,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798905759] [2019-12-18 17:49:33,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:33,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:49:33,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978835209] [2019-12-18 17:49:33,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:49:33,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:33,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:49:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:33,640 INFO L87 Difference]: Start difference. First operand 26716 states and 82150 transitions. Second operand 3 states. [2019-12-18 17:49:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:34,011 INFO L93 Difference]: Finished difference Result 35534 states and 108780 transitions. [2019-12-18 17:49:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:49:34,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 17:49:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:34,070 INFO L225 Difference]: With dead ends: 35534 [2019-12-18 17:49:34,070 INFO L226 Difference]: Without dead ends: 35534 [2019-12-18 17:49:34,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:49:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35534 states. [2019-12-18 17:49:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35534 to 25407. [2019-12-18 17:49:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25407 states. [2019-12-18 17:49:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25407 states to 25407 states and 77774 transitions. [2019-12-18 17:49:34,555 INFO L78 Accepts]: Start accepts. Automaton has 25407 states and 77774 transitions. Word has length 67 [2019-12-18 17:49:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:34,555 INFO L462 AbstractCegarLoop]: Abstraction has 25407 states and 77774 transitions. [2019-12-18 17:49:34,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:49:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25407 states and 77774 transitions. [2019-12-18 17:49:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:34,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:34,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:34,583 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 2 times [2019-12-18 17:49:34,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:34,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838162409] [2019-12-18 17:49:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:34,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838162409] [2019-12-18 17:49:34,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:34,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:49:34,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167545235] [2019-12-18 17:49:34,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:49:34,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:49:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:49:34,725 INFO L87 Difference]: Start difference. First operand 25407 states and 77774 transitions. Second operand 10 states. [2019-12-18 17:49:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:36,799 INFO L93 Difference]: Finished difference Result 55994 states and 174011 transitions. [2019-12-18 17:49:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 17:49:36,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 17:49:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:36,889 INFO L225 Difference]: With dead ends: 55994 [2019-12-18 17:49:36,889 INFO L226 Difference]: Without dead ends: 55994 [2019-12-18 17:49:36,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-18 17:49:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55994 states. [2019-12-18 17:49:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55994 to 27160. [2019-12-18 17:49:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27160 states. [2019-12-18 17:49:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27160 states to 27160 states and 83332 transitions. [2019-12-18 17:49:37,544 INFO L78 Accepts]: Start accepts. Automaton has 27160 states and 83332 transitions. Word has length 67 [2019-12-18 17:49:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:37,544 INFO L462 AbstractCegarLoop]: Abstraction has 27160 states and 83332 transitions. [2019-12-18 17:49:37,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:49:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27160 states and 83332 transitions. [2019-12-18 17:49:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:37,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:37,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:37,577 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-18 17:49:37,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:37,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294936576] [2019-12-18 17:49:37,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:49:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:49:37,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294936576] [2019-12-18 17:49:37,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:49:37,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:49:37,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223170666] [2019-12-18 17:49:37,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:49:37,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:49:37,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:49:37,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:49:37,690 INFO L87 Difference]: Start difference. First operand 27160 states and 83332 transitions. Second operand 5 states. [2019-12-18 17:49:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:49:37,918 INFO L93 Difference]: Finished difference Result 27005 states and 82599 transitions. [2019-12-18 17:49:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:49:37,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 17:49:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:49:37,987 INFO L225 Difference]: With dead ends: 27005 [2019-12-18 17:49:37,988 INFO L226 Difference]: Without dead ends: 27005 [2019-12-18 17:49:37,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:49:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27005 states. [2019-12-18 17:49:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27005 to 21810. [2019-12-18 17:49:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21810 states. [2019-12-18 17:49:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21810 states to 21810 states and 65942 transitions. [2019-12-18 17:49:38,877 INFO L78 Accepts]: Start accepts. Automaton has 21810 states and 65942 transitions. Word has length 67 [2019-12-18 17:49:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:49:38,878 INFO L462 AbstractCegarLoop]: Abstraction has 21810 states and 65942 transitions. [2019-12-18 17:49:38,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:49:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21810 states and 65942 transitions. [2019-12-18 17:49:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:49:38,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:49:38,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:49:38,917 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:49:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:49:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-18 17:49:38,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:49:38,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780760034] [2019-12-18 17:49:38,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:49:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:49:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:49:39,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:49:39,092 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:49:39,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26|) 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1388~0.base_26|) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_26|) |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0)) |v_#memory_int_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1388~0.base_26| 4)) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t1388~0.offset_19| 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_~#t1388~0.base=|v_ULTIMATE.start_main_~#t1388~0.base_26|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_23|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132, ULTIMATE.start_main_~#t1388~0.offset=|v_ULTIMATE.start_main_~#t1388~0.offset_19|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_12|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1389~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1390~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1388~0.base, 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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1389~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1388~0.offset, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-18 17:49:39,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1389~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1389~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t1389~0.base_9| 0)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1389~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9|) |v_ULTIMATE.start_main_~#t1389~0.offset_8| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_9|, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1389~0.base, ULTIMATE.start_main_~#t1389~0.offset] because there is no mapped edge [2019-12-18 17:49:39,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| 1) (= 1 ~z$w_buff0~0_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.base_In-2105613132| P0Thread1of1ForFork0_~arg.base_Out-2105613132) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2105613132| P0Thread1of1ForFork0_~arg.offset_Out-2105613132) (= ~z$w_buff1_used~0_Out-2105613132 ~z$w_buff0_used~0_In-2105613132) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132) (= ~z$w_buff0~0_In-2105613132 ~z$w_buff1~0_Out-2105613132) (= ~z$w_buff0_used~0_Out-2105613132 1) (= 0 (mod ~z$w_buff1_used~0_Out-2105613132 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105613132, ~z$w_buff0~0=~z$w_buff0~0_In-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2105613132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2105613132, ~z$w_buff0~0=~z$w_buff0~0_Out-2105613132, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2105613132, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2105613132|, ~z$w_buff1~0=~z$w_buff1~0_Out-2105613132, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2105613132, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2105613132|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2105613132} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:49:39,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1390~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11|) |v_ULTIMATE.start_main_~#t1390~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1390~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1390~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1390~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1390~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-18 17:49:39,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| |P1Thread1of1ForFork1_#t~ite10_Out-1406132799|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1406132799 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1406132799 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z~0_In-1406132799)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1406132799| ~z$w_buff1~0_In-1406132799) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1406132799|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1406132799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1406132799, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1406132799|, ~z$w_buff1~0=~z$w_buff1~0_In-1406132799, ~z~0=~z~0_In-1406132799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 17:49:39,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In293090503 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In293090503 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out293090503| ~z$w_buff0_used~0_In293090503) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In293090503, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out293090503|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In293090503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 17:49:39,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1588037877 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1588037877 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1588037877 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1588037877 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|)) (and (= ~z$w_buff1_used~0_In-1588037877 |P1Thread1of1ForFork1_#t~ite12_Out-1588037877|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1588037877, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1588037877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1588037877, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1588037877|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1588037877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:49:39,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-681108308 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-681108308 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-681108308| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-681108308 |P1Thread1of1ForFork1_#t~ite13_Out-681108308|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-681108308, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-681108308|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-681108308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 17:49:39,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In91546019 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| ~z$w_buff1~0_In91546019)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In91546019 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In91546019 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In91546019 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In91546019 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out91546019| ~z$w_buff1~0_In91546019) .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out91546019| |P2Thread1of1ForFork2_#t~ite23_Out91546019|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out91546019|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out91546019|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In91546019, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In91546019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In91546019, ~z$w_buff1~0=~z$w_buff1~0_In91546019, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In91546019, ~weak$$choice2~0=~weak$$choice2~0_In91546019} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:49:39,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1980040914 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| ~z$w_buff0_used~0_In-1980040914) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1980040914 256)))) (or (= (mod ~z$w_buff0_used~0_In-1980040914 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1980040914 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In-1980040914 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-1980040914| |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|) (= ~z$w_buff0_used~0_In-1980040914 |P2Thread1of1ForFork2_#t~ite26_Out-1980040914|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1980040914|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1980040914, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1980040914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1980040914, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1980040914, ~weak$$choice2~0=~weak$$choice2~0_In-1980040914, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1980040914|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 17:49:39,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-122877400 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-122877400 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-122877400 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-122877400 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-122877400 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-122877400|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-122877400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-122877400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-122877400, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-122877400|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-122877400} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:49:39,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:49:39,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In117522236 256) 0))) (or (and (= ~z$w_buff1_used~0_In117522236 |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In117522236| |P2Thread1of1ForFork2_#t~ite29_Out117522236|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In117522236 256)))) (or (and (= (mod ~z$w_buff1_used~0_In117522236 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In117522236 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In117522236 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| |P2Thread1of1ForFork2_#t~ite30_Out117522236|) (= |P2Thread1of1ForFork2_#t~ite29_Out117522236| ~z$w_buff1_used~0_In117522236)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In117522236|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out117522236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In117522236, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In117522236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In117522236, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In117522236, ~weak$$choice2~0=~weak$$choice2~0_In117522236, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out117522236|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:49:39,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:49:39,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:49:39,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In937064602 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In937064602 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In937064602 |P0Thread1of1ForFork0_#t~ite5_Out937064602|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out937064602|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out937064602|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In937064602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In937064602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:49:39,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1467113873 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1467113873 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1467113873 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1467113873 256)))) (or (and (= ~z$w_buff1_used~0_In1467113873 |P0Thread1of1ForFork0_#t~ite6_Out1467113873|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1467113873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1467113873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1467113873, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1467113873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1467113873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1467113873} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:49:39,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-576776579 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-576776579 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-576776579)) (and (= ~z$r_buff0_thd1~0_In-576776579 ~z$r_buff0_thd1~0_Out-576776579) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-576776579} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-576776579, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-576776579|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-576776579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:49:39,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-57959045 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-57959045 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-57959045 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-57959045 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| ~z$r_buff1_thd1~0_In-57959045) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-57959045| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-57959045, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-57959045|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-57959045, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-57959045, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-57959045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:49:39,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:49:39,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1037791142 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1037791142 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| |P2Thread1of1ForFork2_#t~ite39_Out1037791142|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z$w_buff1~0_In1037791142) (not .cse0) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1037791142| ~z~0_In1037791142) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1037791142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037791142, ~z$w_buff1~0=~z$w_buff1~0_In1037791142, ~z~0=~z~0_In1037791142, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1037791142|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1037791142|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 17:49:39,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1273260924 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1273260924 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1273260924 |P2Thread1of1ForFork2_#t~ite40_Out1273260924|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1273260924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273260924, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1273260924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 17:49:39,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1353967229 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1353967229 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1353967229 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1353967229 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1353967229| ~z$w_buff1_used~0_In-1353967229) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1353967229|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1353967229|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353967229, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1353967229, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1353967229, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1353967229} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 17:49:39,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-24423748 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-24423748 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| ~z$r_buff0_thd3~0_In-24423748)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-24423748| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-24423748|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24423748, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24423748} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 17:49:39,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1108939919 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1108939919 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1108939919 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1108939919 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1108939919| 0)) (and (= ~z$r_buff1_thd3~0_In-1108939919 |P2Thread1of1ForFork2_#t~ite43_Out-1108939919|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108939919, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1108939919, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1108939919|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108939919, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1108939919} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 17:49:39,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:49:39,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:49:39,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| |ULTIMATE.start_main_#t~ite48_Out1708150275|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1708150275 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1708150275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z$w_buff1~0_In1708150275) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1708150275| ~z~0_In1708150275) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ~z~0=~z~0_In1708150275} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708150275, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1708150275|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708150275, ~z$w_buff1~0=~z$w_buff1~0_In1708150275, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1708150275|, ~z~0=~z~0_In1708150275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:49:39,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-819050452 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-819050452 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-819050452| ~z$w_buff0_used~0_In-819050452) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-819050452| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-819050452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-819050452, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-819050452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:49:39,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-494240283 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-494240283 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-494240283 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-494240283 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-494240283|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-494240283 |ULTIMATE.start_main_#t~ite50_Out-494240283|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-494240283|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-494240283, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-494240283, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-494240283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-494240283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:49:39,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1723803847 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1723803847 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| ~z$r_buff0_thd0~0_In-1723803847)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1723803847| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1723803847, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1723803847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723803847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:49:39,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1867815364 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1867815364 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1867815364 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1867815364 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1867815364 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1867815364|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1867815364|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867815364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867815364, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867815364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867815364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:49:39,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:49:39,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:49:39 BasicIcfg [2019-12-18 17:49:39,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:49:39,227 INFO L168 Benchmark]: Toolchain (without parser) took 107113.29 ms. Allocated memory was 145.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 953.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,228 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.57 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 156.5 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.62 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,230 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,230 INFO L168 Benchmark]: RCFGBuilder took 824.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,231 INFO L168 Benchmark]: TraceAbstraction took 105428.13 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 896.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:49:39,233 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.57 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 156.5 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.62 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.67 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105428.13 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 896.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L824] FCALL, FORK 0 pthread_create(&t1390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=2, 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] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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=2, 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] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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=7, weak$$choice2=1, x=2, 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_buff1=0, z$w_buff1_used=0] [L785] 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_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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_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=7, 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=2, 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_buff1=0, z$w_buff1_used=0] [L766] 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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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=1, __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=7, 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=2, 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_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, 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_buff1=0, z$w_buff1_used=0] [L797] 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=1, __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=7, weak$$choice2=1, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] 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_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=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 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) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6801 SDtfs, 8795 SDslu, 20832 SDs, 0 SdLazy, 13103 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 69 SyntacticMatches, 20 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 42.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 263162 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 354870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...