/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/mix049_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:39:24,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:39:24,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:39:24,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:39:24,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:39:24,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:39:24,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:39:24,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:39:24,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:39:24,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:39:24,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:39:24,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:39:24,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:39:24,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:39:24,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:39:24,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:39:24,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:39:24,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:39:24,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:39:24,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:39:24,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:39:24,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:39:24,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:39:24,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:39:24,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:39:24,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:39:24,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:39:24,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:39:24,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:39:24,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:39:24,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:39:24,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:39:24,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:39:24,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:39:24,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:39:24,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:39:24,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:39:24,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:39:24,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:39:24,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:39:24,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:39:24,893 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:39:24,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:39:24,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:39:24,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:39:24,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:39:24,921 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:39:24,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:39:24,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:39:24,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:39:24,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:39:24,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:39:24,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:39:24,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:39:24,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:39:24,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:39:24,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:39:24,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:39:24,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:39:24,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:39:24,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:39:24,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:39:24,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:39:24,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:39:24,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:39:24,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:39:25,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:39:25,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:39:25,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:39:25,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:39:25,220 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:39:25,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_power.oepc.i [2019-12-18 17:39:25,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71913a244/c7bb657c71ca4a78ba514875d253b1c5/FLAG66609b5be [2019-12-18 17:39:25,807 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:39:25,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_power.oepc.i [2019-12-18 17:39:25,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71913a244/c7bb657c71ca4a78ba514875d253b1c5/FLAG66609b5be [2019-12-18 17:39:26,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71913a244/c7bb657c71ca4a78ba514875d253b1c5 [2019-12-18 17:39:26,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:39:26,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:39:26,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:39:26,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:39:26,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:39:26,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:26,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26, skipping insertion in model container [2019-12-18 17:39:26,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:26,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:39:26,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:39:26,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:39:26,776 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:39:26,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:39:26,916 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:39:26,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26 WrapperNode [2019-12-18 17:39:26,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:39:26,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:39:26,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:39:26,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:39:26,927 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:39:26" (1/1) ... [2019-12-18 17:39:26,948 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:39:26" (1/1) ... [2019-12-18 17:39:26,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:39:26,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:39:26,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:39:26,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:39:26,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:26,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:26,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:26,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:27,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:27,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:27,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (1/1) ... [2019-12-18 17:39:27,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:39:27,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:39:27,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:39:27,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:39:27,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (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:39:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:39:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:39:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:39:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:39:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:39:27,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:39:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:39:27,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:39:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:39:27,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:39:27,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:39:27,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:39:27,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:39:27,098 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:39:27,879 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:39:27,879 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:39:27,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:39:27 BoogieIcfgContainer [2019-12-18 17:39:27,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:39:27,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:39:27,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:39:27,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:39:27,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:39:26" (1/3) ... [2019-12-18 17:39:27,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783a3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:39:27, skipping insertion in model container [2019-12-18 17:39:27,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:39:26" (2/3) ... [2019-12-18 17:39:27,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783a3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:39:27, skipping insertion in model container [2019-12-18 17:39:27,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:39:27" (3/3) ... [2019-12-18 17:39:27,894 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_power.oepc.i [2019-12-18 17:39:27,902 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:39:27,902 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:39:27,909 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:39:27,910 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:39:27,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:27,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,020 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:39:28,055 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:39:28,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:39:28,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:39:28,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:39:28,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:39:28,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:39:28,078 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:39:28,078 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:39:28,078 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:39:28,096 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 17:39:28,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 17:39:28,190 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 17:39:28,190 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:39:28,212 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:39:28,241 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 17:39:28,294 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 17:39:28,295 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:39:28,314 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:39:28,335 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:39:28,336 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:39:33,714 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 17:39:33,850 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:39:34,200 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 17:39:34,200 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 17:39:34,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 17:39:58,296 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 17:39:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 17:39:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:39:58,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:39:58,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:39:58,304 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:39:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:39:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 17:39:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:39:58,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659785282] [2019-12-18 17:39:58,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:39:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:39:58,588 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:39:58,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659785282] [2019-12-18 17:39:58,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:39:58,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:39:58,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061283230] [2019-12-18 17:39:58,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:39:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:39:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:39:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:39:58,623 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 17:40:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:01,868 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 17:40:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:40:01,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:40:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:02,755 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 17:40:02,755 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 17:40:02,756 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:40:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 17:40:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 17:40:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 17:40:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 17:40:15,286 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 17:40:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:15,286 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 17:40:15,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:40:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 17:40:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:40:15,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:15,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:40:15,292 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:40:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 17:40:15,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:15,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717058973] [2019-12-18 17:40:15,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:15,420 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:40:15,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717058973] [2019-12-18 17:40:15,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:15,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:40:15,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654098265] [2019-12-18 17:40:15,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:40:15,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:40:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:40:15,424 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 17:40:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:21,117 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 17:40:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:40:21,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:40:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:21,764 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 17:40:21,765 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 17:40:21,766 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:40:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 17:40:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 17:40:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 17:40:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 17:40:31,153 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 17:40:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:31,154 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 17:40:31,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:40:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 17:40:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:40:31,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:31,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:40:31,163 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:40:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 17:40:31,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:31,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192407464] [2019-12-18 17:40:31,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:31,220 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:40:31,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192407464] [2019-12-18 17:40:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:31,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:40:31,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037318347] [2019-12-18 17:40:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:40:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:40:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:40:31,223 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 17:40:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:31,385 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 17:40:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:40:31,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:40:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:31,483 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 17:40:31,484 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 17:40:31,485 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:40:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 17:40:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 17:40:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 17:40:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 17:40:37,183 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 17:40:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:37,184 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 17:40:37,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:40:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 17:40:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:40:37,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:37,187 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:40:37,188 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:40:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 17:40:37,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:37,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997157729] [2019-12-18 17:40:37,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:37,259 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:40:37,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997157729] [2019-12-18 17:40:37,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:37,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:40:37,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837795941] [2019-12-18 17:40:37,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:40:37,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:37,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:40:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:40:37,261 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 17:40:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:37,469 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 17:40:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:40:37,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 17:40:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:37,572 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 17:40:37,573 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 17:40:37,573 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:40:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 17:40:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 17:40:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 17:40:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 17:40:38,786 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 17:40:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:38,788 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 17:40:38,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:40:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 17:40:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:40:38,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:38,791 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:40:38,791 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:40:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 17:40:38,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:38,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511431734] [2019-12-18 17:40:38,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:38,872 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:40:38,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511431734] [2019-12-18 17:40:38,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:38,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:40:38,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839265773] [2019-12-18 17:40:38,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:40:38,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:40:38,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:40:38,875 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 17:40:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:39,461 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 17:40:39,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:40:39,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 17:40:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:39,548 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 17:40:39,548 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 17:40:39,549 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:40:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 17:40:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 17:40:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 17:40:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 17:40:40,427 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 17:40:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:40,427 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 17:40:40,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:40:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 17:40:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:40:40,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:40,440 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:40:40,441 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:40:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 17:40:40,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:40,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181029686] [2019-12-18 17:40:40,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:40:40,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181029686] [2019-12-18 17:40:40,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:40,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:40:40,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768929071] [2019-12-18 17:40:40,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:40:40,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:40,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:40:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:40:40,523 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 17:40:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:41,922 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 17:40:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:40:41,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:40:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:42,037 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 17:40:42,038 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 17:40:42,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:40:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 17:40:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 17:40:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 17:40:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 17:40:42,984 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 17:40:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 17:40:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:40:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 17:40:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:40:43,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:43,002 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:40:43,002 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:40:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 17:40:43,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:43,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110588401] [2019-12-18 17:40:43,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:43,052 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:40:43,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110588401] [2019-12-18 17:40:43,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:43,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:40:43,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353141095] [2019-12-18 17:40:43,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:40:43,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:40:43,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:40:43,054 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 17:40:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:43,151 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 17:40:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:40:43,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:40:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:43,184 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 17:40:43,185 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 17:40:43,186 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:40:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 17:40:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 17:40:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 17:40:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 17:40:43,940 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 17:40:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:43,941 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 17:40:43,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:40:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 17:40:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:40:43,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:43,955 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:40:43,955 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:40:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 17:40:43,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:43,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524080156] [2019-12-18 17:40:43,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:44,043 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:40:44,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524080156] [2019-12-18 17:40:44,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:44,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:40:44,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621054129] [2019-12-18 17:40:44,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:40:44,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:40:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:40:44,045 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 17:40:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:44,712 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 17:40:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:40:44,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:40:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:44,756 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 17:40:44,757 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 17:40:44,757 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:40:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 17:40:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 17:40:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 17:40:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 17:40:45,125 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 17:40:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:45,125 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 17:40:45,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:40:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 17:40:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:40:45,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:45,147 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:40:45,147 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:40:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 17:40:45,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:45,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556808422] [2019-12-18 17:40:45,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:40:45,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556808422] [2019-12-18 17:40:45,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:45,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:40:45,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783921503] [2019-12-18 17:40:45,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:40:45,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:40:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:40:45,255 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 17:40:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:46,474 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 17:40:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:40:46,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:40:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:46,516 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 17:40:46,516 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 17:40:46,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:40:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 17:40:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 17:40:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 17:40:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 17:40:46,889 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 17:40:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:46,889 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 17:40:46,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:40:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 17:40:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:40:46,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:46,915 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:40:46,915 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:40:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 17:40:46,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:46,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597371512] [2019-12-18 17:40:46,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:46,996 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:40:46,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597371512] [2019-12-18 17:40:46,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:46,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:40:46,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330172747] [2019-12-18 17:40:46,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:40:46,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:40:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:40:46,998 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 17:40:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:47,094 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-18 17:40:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:40:47,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 17:40:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:47,121 INFO L225 Difference]: With dead ends: 18279 [2019-12-18 17:40:47,121 INFO L226 Difference]: Without dead ends: 18279 [2019-12-18 17:40:47,122 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:40:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-18 17:40:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-18 17:40:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 17:40:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-18 17:40:47,767 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-18 17:40:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:47,768 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-18 17:40:47,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:40:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-18 17:40:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:40:47,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:47,793 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:40:47,794 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:40:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-18 17:40:47,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:47,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033598051] [2019-12-18 17:40:47,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:47,915 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:40:47,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033598051] [2019-12-18 17:40:47,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:47,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:40:47,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182809620] [2019-12-18 17:40:47,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:40:47,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:40:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:40:47,919 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-18 17:40:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:48,483 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-18 17:40:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:40:48,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:40:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:48,543 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 17:40:48,543 INFO L226 Difference]: Without dead ends: 38006 [2019-12-18 17:40:48,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:40:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-18 17:40:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-18 17:40:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-18 17:40:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-18 17:40:49,090 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-18 17:40:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:49,090 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-18 17:40:49,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:40:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-18 17:40:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:40:49,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:49,118 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:40:49,118 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:40:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-18 17:40:49,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:49,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893485069] [2019-12-18 17:40:49,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:49,235 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:40:49,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893485069] [2019-12-18 17:40:49,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:49,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:40:49,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004435143] [2019-12-18 17:40:49,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:40:49,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:40:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:40:49,237 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-18 17:40:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:49,725 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-18 17:40:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:40:49,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:40:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:49,786 INFO L225 Difference]: With dead ends: 57554 [2019-12-18 17:40:49,786 INFO L226 Difference]: Without dead ends: 41745 [2019-12-18 17:40:49,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:40:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-18 17:40:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-18 17:40:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-18 17:40:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-18 17:40:50,810 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-18 17:40:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:50,811 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-18 17:40:50,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:40:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-18 17:40:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:40:50,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:50,845 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:40:50,845 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:40:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-18 17:40:50,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:50,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581121431] [2019-12-18 17:40:50,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:50,957 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:40:50,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581121431] [2019-12-18 17:40:50,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:50,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:40:50,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399420465] [2019-12-18 17:40:50,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:40:50,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:50,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:40:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:40:50,961 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-18 17:40:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:51,451 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-18 17:40:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:40:51,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:40:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:51,529 INFO L225 Difference]: With dead ends: 51247 [2019-12-18 17:40:51,530 INFO L226 Difference]: Without dead ends: 47407 [2019-12-18 17:40:51,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:40:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-18 17:40:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-18 17:40:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-18 17:40:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-18 17:40:52,171 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-18 17:40:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:52,171 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-18 17:40:52,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:40:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-18 17:40:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:40:52,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:52,216 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:40:52,216 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:40:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 17:40:52,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:52,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376460080] [2019-12-18 17:40:52,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:52,309 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:40:52,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376460080] [2019-12-18 17:40:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:52,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:40:52,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764876083] [2019-12-18 17:40:52,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:40:52,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:40:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:40:52,311 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-18 17:40:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:52,424 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-18 17:40:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:40:52,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:40:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:52,471 INFO L225 Difference]: With dead ends: 20919 [2019-12-18 17:40:52,471 INFO L226 Difference]: Without dead ends: 20919 [2019-12-18 17:40:52,472 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:40:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-18 17:40:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-18 17:40:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-18 17:40:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-18 17:40:52,952 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-18 17:40:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:52,952 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-18 17:40:52,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:40:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-18 17:40:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:40:52,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:52,990 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:40:52,990 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:40:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 17:40:52,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:52,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710993781] [2019-12-18 17:40:52,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:53,067 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:40:53,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710993781] [2019-12-18 17:40:53,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:53,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:40:53,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197729367] [2019-12-18 17:40:53,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:40:53,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:40:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:40:53,069 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-18 17:40:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:53,232 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-18 17:40:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:40:53,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:40:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:53,278 INFO L225 Difference]: With dead ends: 24197 [2019-12-18 17:40:53,278 INFO L226 Difference]: Without dead ends: 24197 [2019-12-18 17:40:53,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:40:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-18 17:40:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-18 17:40:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-18 17:40:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-18 17:40:54,045 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-18 17:40:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:54,045 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-18 17:40:54,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:40:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-18 17:40:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:40:54,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:54,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:40:54,069 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:40:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 17:40:54,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:54,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635916489] [2019-12-18 17:40:54,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:54,156 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:40:54,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635916489] [2019-12-18 17:40:54,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:54,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:40:54,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326370852] [2019-12-18 17:40:54,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:40:54,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:40:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:40:54,160 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-18 17:40:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:54,348 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-18 17:40:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:40:54,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 17:40:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:54,393 INFO L225 Difference]: With dead ends: 24621 [2019-12-18 17:40:54,393 INFO L226 Difference]: Without dead ends: 24621 [2019-12-18 17:40:54,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:40:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-18 17:40:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-18 17:40:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-18 17:40:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-18 17:40:54,772 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-18 17:40:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:54,772 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-18 17:40:54,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:40:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-18 17:40:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:40:54,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:54,796 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:40:54,796 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:40:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 17:40:54,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:54,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664443852] [2019-12-18 17:40:54,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:54,971 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:40:54,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664443852] [2019-12-18 17:40:54,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:54,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:40:54,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130376577] [2019-12-18 17:40:54,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:40:54,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:54,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:40:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:40:54,973 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-18 17:40:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:57,013 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-18 17:40:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:40:57,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 17:40:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:57,069 INFO L225 Difference]: With dead ends: 38488 [2019-12-18 17:40:57,069 INFO L226 Difference]: Without dead ends: 30672 [2019-12-18 17:40:57,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:40:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-18 17:40:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-18 17:40:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-18 17:40:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-18 17:40:57,721 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-18 17:40:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:40:57,722 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-18 17:40:57,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:40:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-18 17:40:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:40:57,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:40:57,746 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:40:57,747 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:40:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:40:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-18 17:40:57,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:40:57,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152908956] [2019-12-18 17:40:57,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:40:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:40:57,986 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:40:57,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152908956] [2019-12-18 17:40:57,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:40:57,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:40:57,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939511310] [2019-12-18 17:40:57,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:40:57,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:40:57,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:40:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:40:57,989 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-18 17:40:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:40:59,905 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-18 17:40:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:40:59,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 17:40:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:40:59,950 INFO L225 Difference]: With dead ends: 37884 [2019-12-18 17:40:59,950 INFO L226 Difference]: Without dead ends: 31924 [2019-12-18 17:40:59,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:41:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-18 17:41:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-18 17:41:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-18 17:41:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-18 17:41:00,355 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-18 17:41:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:00,355 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-18 17:41:00,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:41:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-18 17:41:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:00,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:00,377 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:41:00,377 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:41:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-18 17:41:00,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:00,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772168112] [2019-12-18 17:41:00,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:00,542 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:41:00,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772168112] [2019-12-18 17:41:00,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:00,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:41:00,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414316820] [2019-12-18 17:41:00,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:41:00,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:41:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:41:00,544 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-18 17:41:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:02,489 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-18 17:41:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:41:02,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:41:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:02,538 INFO L225 Difference]: With dead ends: 34983 [2019-12-18 17:41:02,538 INFO L226 Difference]: Without dead ends: 31500 [2019-12-18 17:41:02,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:41:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-18 17:41:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-18 17:41:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-18 17:41:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-18 17:41:02,958 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-18 17:41:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:02,959 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-18 17:41:02,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:41:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-18 17:41:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:02,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:02,983 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:41:02,983 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:41:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-18 17:41:02,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:02,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010643433] [2019-12-18 17:41:02,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:03,274 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:41:03,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010643433] [2019-12-18 17:41:03,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:03,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:41:03,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408524711] [2019-12-18 17:41:03,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:41:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:41:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:41:03,276 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 12 states. [2019-12-18 17:41:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:07,779 INFO L93 Difference]: Finished difference Result 37217 states and 111509 transitions. [2019-12-18 17:41:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 17:41:07,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 17:41:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:07,828 INFO L225 Difference]: With dead ends: 37217 [2019-12-18 17:41:07,829 INFO L226 Difference]: Without dead ends: 36953 [2019-12-18 17:41:07,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=2195, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 17:41:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36953 states. [2019-12-18 17:41:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36953 to 27801. [2019-12-18 17:41:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27801 states. [2019-12-18 17:41:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27801 states to 27801 states and 84914 transitions. [2019-12-18 17:41:08,334 INFO L78 Accepts]: Start accepts. Automaton has 27801 states and 84914 transitions. Word has length 66 [2019-12-18 17:41:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:08,334 INFO L462 AbstractCegarLoop]: Abstraction has 27801 states and 84914 transitions. [2019-12-18 17:41:08,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:41:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 27801 states and 84914 transitions. [2019-12-18 17:41:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:08,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:08,367 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:41:08,367 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:41:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 883991506, now seen corresponding path program 5 times [2019-12-18 17:41:08,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:08,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392342021] [2019-12-18 17:41:08,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:08,471 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:41:08,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392342021] [2019-12-18 17:41:08,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:08,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:41:08,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110887870] [2019-12-18 17:41:08,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:41:08,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:41:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:41:08,473 INFO L87 Difference]: Start difference. First operand 27801 states and 84914 transitions. Second operand 8 states. [2019-12-18 17:41:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:09,886 INFO L93 Difference]: Finished difference Result 39817 states and 118762 transitions. [2019-12-18 17:41:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:41:09,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 17:41:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:09,942 INFO L225 Difference]: With dead ends: 39817 [2019-12-18 17:41:09,942 INFO L226 Difference]: Without dead ends: 39717 [2019-12-18 17:41:09,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:41:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39717 states. [2019-12-18 17:41:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39717 to 30159. [2019-12-18 17:41:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30159 states. [2019-12-18 17:41:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30159 states to 30159 states and 91762 transitions. [2019-12-18 17:41:10,921 INFO L78 Accepts]: Start accepts. Automaton has 30159 states and 91762 transitions. Word has length 66 [2019-12-18 17:41:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:10,922 INFO L462 AbstractCegarLoop]: Abstraction has 30159 states and 91762 transitions. [2019-12-18 17:41:10,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:41:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30159 states and 91762 transitions. [2019-12-18 17:41:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:10,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:10,963 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:41:10,963 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:41:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1390949788, now seen corresponding path program 6 times [2019-12-18 17:41:10,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:10,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126579420] [2019-12-18 17:41:10,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:11,102 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:41:11,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126579420] [2019-12-18 17:41:11,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:11,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:41:11,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751150889] [2019-12-18 17:41:11,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:41:11,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:41:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:41:11,106 INFO L87 Difference]: Start difference. First operand 30159 states and 91762 transitions. Second operand 11 states. [2019-12-18 17:41:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:13,665 INFO L93 Difference]: Finished difference Result 54171 states and 162481 transitions. [2019-12-18 17:41:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 17:41:13,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:41:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:13,730 INFO L225 Difference]: With dead ends: 54171 [2019-12-18 17:41:13,730 INFO L226 Difference]: Without dead ends: 47308 [2019-12-18 17:41:13,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2019-12-18 17:41:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47308 states. [2019-12-18 17:41:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47308 to 30162. [2019-12-18 17:41:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30162 states. [2019-12-18 17:41:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30162 states to 30162 states and 91519 transitions. [2019-12-18 17:41:14,323 INFO L78 Accepts]: Start accepts. Automaton has 30162 states and 91519 transitions. Word has length 66 [2019-12-18 17:41:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:14,323 INFO L462 AbstractCegarLoop]: Abstraction has 30162 states and 91519 transitions. [2019-12-18 17:41:14,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:41:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30162 states and 91519 transitions. [2019-12-18 17:41:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:14,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:14,354 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:41:14,354 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:41:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash -793831102, now seen corresponding path program 7 times [2019-12-18 17:41:14,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:14,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109551813] [2019-12-18 17:41:14,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:14,522 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:41:14,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109551813] [2019-12-18 17:41:14,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:14,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:41:14,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511452422] [2019-12-18 17:41:14,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:41:14,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:14,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:41:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:41:14,525 INFO L87 Difference]: Start difference. First operand 30162 states and 91519 transitions. Second operand 11 states. [2019-12-18 17:41:17,845 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-18 17:41:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:18,172 INFO L93 Difference]: Finished difference Result 37886 states and 112959 transitions. [2019-12-18 17:41:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 17:41:18,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:41:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:18,221 INFO L225 Difference]: With dead ends: 37886 [2019-12-18 17:41:18,221 INFO L226 Difference]: Without dead ends: 37758 [2019-12-18 17:41:18,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 17:41:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37758 states. [2019-12-18 17:41:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37758 to 26433. [2019-12-18 17:41:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26433 states. [2019-12-18 17:41:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26433 states to 26433 states and 80597 transitions. [2019-12-18 17:41:18,713 INFO L78 Accepts]: Start accepts. Automaton has 26433 states and 80597 transitions. Word has length 66 [2019-12-18 17:41:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:18,713 INFO L462 AbstractCegarLoop]: Abstraction has 26433 states and 80597 transitions. [2019-12-18 17:41:18,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:41:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 26433 states and 80597 transitions. [2019-12-18 17:41:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:18,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:18,746 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:41:18,746 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:41:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1722915508, now seen corresponding path program 8 times [2019-12-18 17:41:18,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:18,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453365091] [2019-12-18 17:41:18,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:19,243 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:41:19,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453365091] [2019-12-18 17:41:19,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:19,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 17:41:19,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961158478] [2019-12-18 17:41:19,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 17:41:19,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 17:41:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:41:19,244 INFO L87 Difference]: Start difference. First operand 26433 states and 80597 transitions. Second operand 20 states. [2019-12-18 17:41:27,010 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-18 17:41:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:32,703 INFO L93 Difference]: Finished difference Result 50769 states and 153123 transitions. [2019-12-18 17:41:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-12-18 17:41:32,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-18 17:41:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:32,814 INFO L225 Difference]: With dead ends: 50769 [2019-12-18 17:41:32,814 INFO L226 Difference]: Without dead ends: 46832 [2019-12-18 17:41:32,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7144 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1800, Invalid=17382, Unknown=0, NotChecked=0, Total=19182 [2019-12-18 17:41:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46832 states. [2019-12-18 17:41:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46832 to 28116. [2019-12-18 17:41:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28116 states. [2019-12-18 17:41:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28116 states to 28116 states and 86015 transitions. [2019-12-18 17:41:33,480 INFO L78 Accepts]: Start accepts. Automaton has 28116 states and 86015 transitions. Word has length 66 [2019-12-18 17:41:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 28116 states and 86015 transitions. [2019-12-18 17:41:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 17:41:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28116 states and 86015 transitions. [2019-12-18 17:41:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:33,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:33,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:41:33,520 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:41:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1721003244, now seen corresponding path program 9 times [2019-12-18 17:41:33,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:33,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660314212] [2019-12-18 17:41:33,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:33,694 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:41:33,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660314212] [2019-12-18 17:41:33,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:33,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:41:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793467763] [2019-12-18 17:41:33,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:41:33,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:41:33,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:41:33,696 INFO L87 Difference]: Start difference. First operand 28116 states and 86015 transitions. Second operand 11 states. [2019-12-18 17:41:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:35,960 INFO L93 Difference]: Finished difference Result 40889 states and 125374 transitions. [2019-12-18 17:41:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:41:35,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:41:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:36,010 INFO L225 Difference]: With dead ends: 40889 [2019-12-18 17:41:36,010 INFO L226 Difference]: Without dead ends: 37657 [2019-12-18 17:41:36,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:41:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37657 states. [2019-12-18 17:41:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37657 to 29351. [2019-12-18 17:41:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29351 states. [2019-12-18 17:41:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29351 states to 29351 states and 89503 transitions. [2019-12-18 17:41:36,516 INFO L78 Accepts]: Start accepts. Automaton has 29351 states and 89503 transitions. Word has length 66 [2019-12-18 17:41:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:36,516 INFO L462 AbstractCegarLoop]: Abstraction has 29351 states and 89503 transitions. [2019-12-18 17:41:36,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:41:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29351 states and 89503 transitions. [2019-12-18 17:41:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:36,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:36,550 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:41:36,550 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:41:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash 742453144, now seen corresponding path program 10 times [2019-12-18 17:41:36,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:36,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741971197] [2019-12-18 17:41:36,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:36,714 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:41:36,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741971197] [2019-12-18 17:41:36,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:36,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:41:36,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294852183] [2019-12-18 17:41:36,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:41:36,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:41:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:41:36,717 INFO L87 Difference]: Start difference. First operand 29351 states and 89503 transitions. Second operand 11 states. [2019-12-18 17:41:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:38,533 INFO L93 Difference]: Finished difference Result 45044 states and 136661 transitions. [2019-12-18 17:41:38,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:41:38,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 17:41:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:38,597 INFO L225 Difference]: With dead ends: 45044 [2019-12-18 17:41:38,597 INFO L226 Difference]: Without dead ends: 40195 [2019-12-18 17:41:38,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:41:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40195 states. [2019-12-18 17:41:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40195 to 28168. [2019-12-18 17:41:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28168 states. [2019-12-18 17:41:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28168 states to 28168 states and 86039 transitions. [2019-12-18 17:41:39,130 INFO L78 Accepts]: Start accepts. Automaton has 28168 states and 86039 transitions. Word has length 66 [2019-12-18 17:41:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:39,131 INFO L462 AbstractCegarLoop]: Abstraction has 28168 states and 86039 transitions. [2019-12-18 17:41:39,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:41:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 28168 states and 86039 transitions. [2019-12-18 17:41:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:41:39,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:39,159 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:41:39,159 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:41:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1833986216, now seen corresponding path program 11 times [2019-12-18 17:41:39,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:39,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571036383] [2019-12-18 17:41:39,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:39,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:41:39,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571036383] [2019-12-18 17:41:39,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:39,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:41:39,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642287719] [2019-12-18 17:41:39,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:41:39,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:39,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:41:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:41:39,221 INFO L87 Difference]: Start difference. First operand 28168 states and 86039 transitions. Second operand 3 states. [2019-12-18 17:41:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:39,347 INFO L93 Difference]: Finished difference Result 28168 states and 86038 transitions. [2019-12-18 17:41:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:41:39,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:41:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:39,401 INFO L225 Difference]: With dead ends: 28168 [2019-12-18 17:41:39,402 INFO L226 Difference]: Without dead ends: 28168 [2019-12-18 17:41:39,402 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:41:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28168 states. [2019-12-18 17:41:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28168 to 23598. [2019-12-18 17:41:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23598 states. [2019-12-18 17:41:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23598 states to 23598 states and 72911 transitions. [2019-12-18 17:41:40,254 INFO L78 Accepts]: Start accepts. Automaton has 23598 states and 72911 transitions. Word has length 66 [2019-12-18 17:41:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:40,255 INFO L462 AbstractCegarLoop]: Abstraction has 23598 states and 72911 transitions. [2019-12-18 17:41:40,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:41:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23598 states and 72911 transitions. [2019-12-18 17:41:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:41:40,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:40,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:41:40,279 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:41:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 1 times [2019-12-18 17:41:40,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:40,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681983878] [2019-12-18 17:41:40,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:40,454 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:41:40,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681983878] [2019-12-18 17:41:40,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:40,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:41:40,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140693228] [2019-12-18 17:41:40,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:41:40,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:41:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:41:40,455 INFO L87 Difference]: Start difference. First operand 23598 states and 72911 transitions. Second operand 12 states. [2019-12-18 17:41:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:42,501 INFO L93 Difference]: Finished difference Result 34451 states and 105966 transitions. [2019-12-18 17:41:42,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:41:42,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 17:41:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:42,553 INFO L225 Difference]: With dead ends: 34451 [2019-12-18 17:41:42,554 INFO L226 Difference]: Without dead ends: 32995 [2019-12-18 17:41:42,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:41:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32995 states. [2019-12-18 17:41:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32995 to 23476. [2019-12-18 17:41:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23476 states. [2019-12-18 17:41:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23476 states to 23476 states and 72573 transitions. [2019-12-18 17:41:43,005 INFO L78 Accepts]: Start accepts. Automaton has 23476 states and 72573 transitions. Word has length 67 [2019-12-18 17:41:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:43,005 INFO L462 AbstractCegarLoop]: Abstraction has 23476 states and 72573 transitions. [2019-12-18 17:41:43,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:41:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23476 states and 72573 transitions. [2019-12-18 17:41:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:41:43,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:43,033 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:41:43,033 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:41:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 2 times [2019-12-18 17:41:43,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:43,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674789213] [2019-12-18 17:41:43,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:43,586 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:41:43,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674789213] [2019-12-18 17:41:43,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:43,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 17:41:43,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014693412] [2019-12-18 17:41:43,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 17:41:43,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 17:41:43,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:41:43,589 INFO L87 Difference]: Start difference. First operand 23476 states and 72573 transitions. Second operand 19 states. [2019-12-18 17:41:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:51,513 INFO L93 Difference]: Finished difference Result 35372 states and 108755 transitions. [2019-12-18 17:41:51,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 17:41:51,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 17:41:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:51,568 INFO L225 Difference]: With dead ends: 35372 [2019-12-18 17:41:51,568 INFO L226 Difference]: Without dead ends: 34749 [2019-12-18 17:41:51,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=427, Invalid=2765, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 17:41:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34749 states. [2019-12-18 17:41:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34749 to 23868. [2019-12-18 17:41:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23868 states. [2019-12-18 17:41:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23868 states to 23868 states and 73644 transitions. [2019-12-18 17:41:52,013 INFO L78 Accepts]: Start accepts. Automaton has 23868 states and 73644 transitions. Word has length 67 [2019-12-18 17:41:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:52,013 INFO L462 AbstractCegarLoop]: Abstraction has 23868 states and 73644 transitions. [2019-12-18 17:41:52,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 17:41:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23868 states and 73644 transitions. [2019-12-18 17:41:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:41:52,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:41:52,039 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:41:52,039 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:41:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:41:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2040469818, now seen corresponding path program 3 times [2019-12-18 17:41:52,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:41:52,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923622869] [2019-12-18 17:41:52,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:41:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:41:52,559 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:41:52,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923622869] [2019-12-18 17:41:52,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:41:52,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 17:41:52,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416534964] [2019-12-18 17:41:52,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 17:41:52,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:41:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 17:41:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:41:52,561 INFO L87 Difference]: Start difference. First operand 23868 states and 73644 transitions. Second operand 19 states. [2019-12-18 17:41:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:41:59,183 INFO L93 Difference]: Finished difference Result 35419 states and 108326 transitions. [2019-12-18 17:41:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 17:41:59,184 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 17:41:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:41:59,245 INFO L225 Difference]: With dead ends: 35419 [2019-12-18 17:41:59,245 INFO L226 Difference]: Without dead ends: 35138 [2019-12-18 17:41:59,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 17:41:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35138 states. [2019-12-18 17:41:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35138 to 23787. [2019-12-18 17:41:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23787 states. [2019-12-18 17:41:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23787 states to 23787 states and 73428 transitions. [2019-12-18 17:41:59,998 INFO L78 Accepts]: Start accepts. Automaton has 23787 states and 73428 transitions. Word has length 67 [2019-12-18 17:41:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:41:59,999 INFO L462 AbstractCegarLoop]: Abstraction has 23787 states and 73428 transitions. [2019-12-18 17:41:59,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 17:41:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23787 states and 73428 transitions. [2019-12-18 17:42:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:42:00,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:42:00,023 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:42:00,023 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:42:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:42:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1575321640, now seen corresponding path program 4 times [2019-12-18 17:42:00,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:42:00,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957718956] [2019-12-18 17:42:00,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:42:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:42:00,563 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:42:00,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957718956] [2019-12-18 17:42:00,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:42:00,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 17:42:00,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520355214] [2019-12-18 17:42:00,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 17:42:00,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:42:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 17:42:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:42:00,565 INFO L87 Difference]: Start difference. First operand 23787 states and 73428 transitions. Second operand 20 states. [2019-12-18 17:42:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:42:07,388 INFO L93 Difference]: Finished difference Result 40558 states and 121953 transitions. [2019-12-18 17:42:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 17:42:07,388 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 17:42:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:42:07,448 INFO L225 Difference]: With dead ends: 40558 [2019-12-18 17:42:07,448 INFO L226 Difference]: Without dead ends: 40004 [2019-12-18 17:42:07,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=621, Invalid=3285, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 17:42:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40004 states. [2019-12-18 17:42:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40004 to 23583. [2019-12-18 17:42:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23583 states. [2019-12-18 17:42:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23583 states to 23583 states and 72851 transitions. [2019-12-18 17:42:07,962 INFO L78 Accepts]: Start accepts. Automaton has 23583 states and 72851 transitions. Word has length 67 [2019-12-18 17:42:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:42:07,962 INFO L462 AbstractCegarLoop]: Abstraction has 23583 states and 72851 transitions. [2019-12-18 17:42:07,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 17:42:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 23583 states and 72851 transitions. [2019-12-18 17:42:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:42:07,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:42:07,990 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:42:07,991 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:42:07,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:42:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 5 times [2019-12-18 17:42:07,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:42:07,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716512348] [2019-12-18 17:42:07,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:42:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:42:08,149 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:42:08,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716512348] [2019-12-18 17:42:08,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:42:08,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:42:08,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074974710] [2019-12-18 17:42:08,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:42:08,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:42:08,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:42:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:42:08,152 INFO L87 Difference]: Start difference. First operand 23583 states and 72851 transitions. Second operand 11 states. [2019-12-18 17:42:08,485 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 17:42:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:42:10,770 INFO L93 Difference]: Finished difference Result 36064 states and 110411 transitions. [2019-12-18 17:42:10,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:42:10,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 17:42:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:42:10,821 INFO L225 Difference]: With dead ends: 36064 [2019-12-18 17:42:10,821 INFO L226 Difference]: Without dead ends: 35137 [2019-12-18 17:42:10,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:42:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2019-12-18 17:42:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 23487. [2019-12-18 17:42:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23487 states. [2019-12-18 17:42:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23487 states to 23487 states and 72591 transitions. [2019-12-18 17:42:11,292 INFO L78 Accepts]: Start accepts. Automaton has 23487 states and 72591 transitions. Word has length 67 [2019-12-18 17:42:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:42:11,292 INFO L462 AbstractCegarLoop]: Abstraction has 23487 states and 72591 transitions. [2019-12-18 17:42:11,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:42:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23487 states and 72591 transitions. [2019-12-18 17:42:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:42:11,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:42:11,320 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:42:11,320 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:42:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:42:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 6 times [2019-12-18 17:42:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:42:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309743335] [2019-12-18 17:42:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:42:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:42:11,479 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:42:11,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309743335] [2019-12-18 17:42:11,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:42:11,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:42:11,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46132760] [2019-12-18 17:42:11,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:42:11,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:42:11,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:42:11,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:42:11,481 INFO L87 Difference]: Start difference. First operand 23487 states and 72591 transitions. Second operand 12 states. [2019-12-18 17:42:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:42:14,502 INFO L93 Difference]: Finished difference Result 37555 states and 114933 transitions. [2019-12-18 17:42:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 17:42:14,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 17:42:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:42:14,554 INFO L225 Difference]: With dead ends: 37555 [2019-12-18 17:42:14,554 INFO L226 Difference]: Without dead ends: 34914 [2019-12-18 17:42:14,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-12-18 17:42:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34914 states. [2019-12-18 17:42:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34914 to 22889. [2019-12-18 17:42:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22889 states. [2019-12-18 17:42:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22889 states to 22889 states and 70945 transitions. [2019-12-18 17:42:15,012 INFO L78 Accepts]: Start accepts. Automaton has 22889 states and 70945 transitions. Word has length 67 [2019-12-18 17:42:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:42:15,013 INFO L462 AbstractCegarLoop]: Abstraction has 22889 states and 70945 transitions. [2019-12-18 17:42:15,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:42:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22889 states and 70945 transitions. [2019-12-18 17:42:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:42:15,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:42:15,036 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:42:15,036 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:42:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:42:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 7 times [2019-12-18 17:42:15,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:42:15,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084946202] [2019-12-18 17:42:15,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:42:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:42:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:42:15,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:42:15,177 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:42:15,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1297~0.base_23|) (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1297~0.base_23|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1297~0.base_23| 4) |v_#length_21|) (= 0 |v_ULTIMATE.start_main_~#t1297~0.offset_17|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1297~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1297~0.base_23|) |v_ULTIMATE.start_main_~#t1297~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1297~0.base_23| 1)) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_~#t1299~0.offset=|v_ULTIMATE.start_main_~#t1299~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t1298~0.base=|v_ULTIMATE.start_main_~#t1298~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1299~0.base=|v_ULTIMATE.start_main_~#t1299~0.base_17|, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1297~0.base=|v_ULTIMATE.start_main_~#t1297~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ULTIMATE.start_main_~#t1298~0.offset=|v_ULTIMATE.start_main_~#t1298~0.offset_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ULTIMATE.start_main_~#t1297~0.offset=|v_ULTIMATE.start_main_~#t1297~0.offset_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1299~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1298~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1299~0.base, ~x~0, ULTIMATE.start_main_~#t1297~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1298~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1297~0.offset, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:42:15,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1298~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1298~0.base_11|) |v_ULTIMATE.start_main_~#t1298~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1298~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1298~0.base_11| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1298~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1298~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1298~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1298~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1298~0.base=|v_ULTIMATE.start_main_~#t1298~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, ULTIMATE.start_main_~#t1298~0.offset=|v_ULTIMATE.start_main_~#t1298~0.offset_9|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1298~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1298~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:42:15,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:42:15,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-869146186 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-869146186 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-869146186| ~z$w_buff1~0_In-869146186) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-869146186| ~z~0_In-869146186)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$w_buff1~0=~z$w_buff1~0_In-869146186, ~z~0=~z~0_In-869146186} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-869146186|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$w_buff1~0=~z$w_buff1~0_In-869146186, ~z~0=~z~0_In-869146186} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 17:42:15,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 17:42:15,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1299~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1299~0.base_13|) |v_ULTIMATE.start_main_~#t1299~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1299~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1299~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1299~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1299~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1299~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1299~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1299~0.offset=|v_ULTIMATE.start_main_~#t1299~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1299~0.base=|v_ULTIMATE.start_main_~#t1299~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1299~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1299~0.base] because there is no mapped edge [2019-12-18 17:42:15,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1925375327 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1925375327 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1925375327| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1925375327| ~z$w_buff0_used~0_In-1925375327) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925375327, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1925375327} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1925375327, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1925375327|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1925375327} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:42:15,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1837910828 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1837910828 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1837910828 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1837910828 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1837910828|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1837910828| ~z$w_buff1_used~0_In-1837910828) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837910828, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1837910828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837910828, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1837910828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837910828, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1837910828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837910828, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1837910828|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1837910828} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 17:42:15,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-564632895 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-564632895 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-564632895 |P1Thread1of1ForFork2_#t~ite13_Out-564632895|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-564632895|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-564632895, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-564632895} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-564632895, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-564632895|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-564632895} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 17:42:15,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1714974384 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out1714974384| ~z$w_buff0_used~0_In1714974384) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1714974384| |P2Thread1of1ForFork0_#t~ite26_Out1714974384|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1714974384| |P2Thread1of1ForFork0_#t~ite26_Out1714974384|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1714974384 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1714974384 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1714974384 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1714974384 256) 0)))) .cse0 (= ~z$w_buff0_used~0_In1714974384 |P2Thread1of1ForFork0_#t~ite26_Out1714974384|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1714974384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714974384, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1714974384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714974384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1714974384, ~weak$$choice2~0=~weak$$choice2~0_In1714974384} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1714974384|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1714974384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714974384, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1714974384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714974384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1714974384, ~weak$$choice2~0=~weak$$choice2~0_In1714974384} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 17:42:15,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 17:42:15,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1251561873 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1251561873 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1251561873 |P0Thread1of1ForFork1_#t~ite5_Out-1251561873|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1251561873|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1251561873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1251561873} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1251561873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1251561873, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1251561873} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 17:42:15,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:42:15,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2077767534| |P2Thread1of1ForFork0_#t~ite39_Out2077767534|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In2077767534 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2077767534 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2077767534| ~z~0_In2077767534) (or .cse1 .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2077767534| ~z$w_buff1~0_In2077767534) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$w_buff1~0=~z$w_buff1~0_In2077767534, ~z~0=~z~0_In2077767534} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2077767534|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2077767534|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$w_buff1~0=~z$w_buff1~0_In2077767534, ~z~0=~z~0_In2077767534} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:42:15,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-19180694 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-19180694 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-19180694| ~z$w_buff0_used~0_In-19180694)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-19180694|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-19180694, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-19180694} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-19180694, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-19180694|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-19180694} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 17:42:15,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1276435502 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1276435502 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1276435502 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1276435502 256)))) (or (and (= ~z$w_buff1_used~0_In1276435502 |P2Thread1of1ForFork0_#t~ite41_Out1276435502|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1276435502|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1276435502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276435502, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1276435502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1276435502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276435502, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1276435502, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1276435502|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 17:42:15,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1167513280 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1167513280 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1167513280| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1167513280| ~z$r_buff0_thd3~0_In1167513280) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1167513280, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1167513280} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1167513280, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1167513280, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1167513280|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 17:42:15,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-2141528988 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2141528988 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2141528988 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2141528988 256)))) (or (and (= ~z$r_buff1_thd3~0_In-2141528988 |P2Thread1of1ForFork0_#t~ite43_Out-2141528988|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-2141528988| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141528988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2141528988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141528988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2141528988} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2141528988|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141528988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2141528988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141528988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2141528988} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 17:42:15,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:42:15,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-130040158 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-130040158 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-130040158 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-130040158 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-130040158| ~z$w_buff1_used~0_In-130040158) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-130040158| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-130040158, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-130040158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-130040158, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-130040158} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-130040158, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-130040158|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-130040158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-130040158, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-130040158} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 17:42:15,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1409184514 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1409184514 256)))) (or (and (= ~z$r_buff0_thd1~0_In1409184514 ~z$r_buff0_thd1~0_Out1409184514) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1409184514)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1409184514, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1409184514} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1409184514, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1409184514|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1409184514} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:42:15,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1839978182 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1839978182 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1839978182 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1839978182 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1839978182|)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-1839978182| ~z$r_buff1_thd1~0_In-1839978182) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1839978182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839978182, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1839978182} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1839978182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1839978182, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1839978182, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1839978182} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:42:15,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:42:15,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-119607970 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-119607970 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-119607970 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-119607970 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-119607970 |P1Thread1of1ForFork2_#t~ite14_Out-119607970|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-119607970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-119607970} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-119607970|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-119607970} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 17:42:15,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:42:15,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:42:15,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1447513033 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1447513033 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out1447513033| |ULTIMATE.start_main_#t~ite47_Out1447513033|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1447513033 |ULTIMATE.start_main_#t~ite47_Out1447513033|) .cse2) (and (or .cse0 .cse1) (= ~z~0_In1447513033 |ULTIMATE.start_main_#t~ite47_Out1447513033|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033, ~z$w_buff1~0=~z$w_buff1~0_In1447513033, ~z~0=~z~0_In1447513033} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1447513033|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033, ~z$w_buff1~0=~z$w_buff1~0_In1447513033, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1447513033|, ~z~0=~z~0_In1447513033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:42:15,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-137159647 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-137159647 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-137159647 |ULTIMATE.start_main_#t~ite49_Out-137159647|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-137159647|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137159647, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137159647, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-137159647|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:42:15,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In102759287 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In102759287 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In102759287 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In102759287 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out102759287|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In102759287 |ULTIMATE.start_main_#t~ite50_Out102759287|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102759287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out102759287|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102759287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:42:15,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-666893180 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-666893180 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-666893180 |ULTIMATE.start_main_#t~ite51_Out-666893180|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-666893180|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-666893180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-666893180, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-666893180|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:42:15,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1351494881 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1351494881 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1351494881 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1351494881 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1351494881|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1351494881 |ULTIMATE.start_main_#t~ite52_Out1351494881|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1351494881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1351494881|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1351494881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:42:15,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:42:15,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:42:15 BasicIcfg [2019-12-18 17:42:15,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:42:15,320 INFO L168 Benchmark]: Toolchain (without parser) took 169188.01 ms. Allocated memory was 141.0 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 914.1 MB in the end (delta: -813.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,321 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 141.0 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.34 ms. Allocated memory was 141.0 MB in the beginning and 202.9 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 156.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,325 INFO L168 Benchmark]: Boogie Preprocessor took 45.50 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,325 INFO L168 Benchmark]: RCFGBuilder took 854.47 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,325 INFO L168 Benchmark]: TraceAbstraction took 167436.42 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.3 MB in the beginning and 914.1 MB in the end (delta: -813.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 17:42:15,328 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.45 ms. Allocated memory is still 141.0 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.34 ms. Allocated memory was 141.0 MB in the beginning and 202.9 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 156.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.50 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.47 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167436.42 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.3 MB in the beginning and 914.1 MB in the end (delta: -813.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1297, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1298, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1299, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 167.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 83.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10170 SDtfs, 13102 SDslu, 48280 SDs, 0 SdLazy, 59123 SolverSat, 831 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 705 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11534 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 327396 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1787 NumberOfCodeBlocks, 1787 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1687 ConstructedInterpolants, 0 QuantifiedInterpolants, 480822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...