/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:25:34,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:25:34,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:25:34,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:25:34,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:25:34,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:25:34,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:25:34,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:25:34,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:25:34,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:25:34,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:25:34,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:25:34,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:25:34,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:25:34,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:25:34,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:25:34,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:25:34,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:25:34,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:25:34,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:25:34,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:25:34,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:25:34,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:25:34,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:25:34,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:25:34,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:25:34,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:25:34,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:25:34,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:25:34,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:25:34,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:25:34,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:25:34,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:25:34,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:25:34,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:25:34,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:25:34,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:25:34,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:25:34,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:25:34,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:25:34,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:25:34,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:25:34,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:25:34,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:25:34,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:25:34,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:25:34,835 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:25:34,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:25:34,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:25:34,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:25:34,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:25:34,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:25:34,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:25:34,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:25:34,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:25:34,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:25:34,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:25:34,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:25:34,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:25:34,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:25:34,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:25:34,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:25:34,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:25:34,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:25:34,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:25:34,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:25:34,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:25:34,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:25:34,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:25:34,844 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:25:34,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:25:34,845 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:25:34,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:25:35,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:25:35,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:25:35,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:25:35,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:25:35,180 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:25:35,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-27 16:25:35,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28498a06a/2401bb663ade4091ae983022f5b136f4/FLAG96dc7829c [2019-12-27 16:25:35,840 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:25:35,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-27 16:25:35,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28498a06a/2401bb663ade4091ae983022f5b136f4/FLAG96dc7829c [2019-12-27 16:25:36,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28498a06a/2401bb663ade4091ae983022f5b136f4 [2019-12-27 16:25:36,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:25:36,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:25:36,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:25:36,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:25:36,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:25:36,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:36,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13609896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36, skipping insertion in model container [2019-12-27 16:25:36,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:36,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:25:36,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:25:36,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:25:36,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:25:36,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:25:36,952 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:25:36,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36 WrapperNode [2019-12-27 16:25:36,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:25:36,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:25:36,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:25:36,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:25:36,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:36,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:25:37,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:25:37,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:25:37,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:25:37,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... [2019-12-27 16:25:37,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:25:37,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:25:37,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:25:37,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:25:37,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:25:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:25:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:25:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:25:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:25:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:25:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:25:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:25:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:25:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:25:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:25:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:25:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:25:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:25:37,120 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:25:37,912 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:25:37,913 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:25:37,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:25:37 BoogieIcfgContainer [2019-12-27 16:25:37,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:25:37,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:25:37,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:25:37,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:25:37,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:25:36" (1/3) ... [2019-12-27 16:25:37,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6252706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:25:37, skipping insertion in model container [2019-12-27 16:25:37,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:25:36" (2/3) ... [2019-12-27 16:25:37,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6252706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:25:37, skipping insertion in model container [2019-12-27 16:25:37,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:25:37" (3/3) ... [2019-12-27 16:25:37,924 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.oepc.i [2019-12-27 16:25:37,935 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:25:37,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:25:37,944 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:25:37,945 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:25:37,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,993 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:37,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:25:38,112 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:25:38,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:25:38,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:25:38,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:25:38,131 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:25:38,131 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:25:38,131 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:25:38,131 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:25:38,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:25:38,147 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 16:25:38,149 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:25:38,254 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:25:38,254 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:25:38,272 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 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:25:38,296 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:25:38,352 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:25:38,352 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:25:38,361 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 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:25:38,385 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:25:38,386 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:25:43,518 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:25:43,641 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:25:43,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 16:25:43,901 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 16:25:43,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 16:26:05,371 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 16:26:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 16:26:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:26:05,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:05,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:26:05,379 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 16:26:05,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:05,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706682955] [2019-12-27 16:26:05,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706682955] [2019-12-27 16:26:05,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:05,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:26:05,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80570724] [2019-12-27 16:26:05,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:05,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:05,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:26:05,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:05,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:05,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:05,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:05,635 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 16:26:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:06,874 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 16:26:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:06,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:26:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:07,493 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 16:26:07,494 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 16:26:07,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 16:26:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 16:26:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 16:26:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 16:26:21,751 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 16:26:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:21,751 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 16:26:21,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 16:26:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:26:21,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:21,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:21,759 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 16:26:21,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:21,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923173418] [2019-12-27 16:26:21,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:21,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923173418] [2019-12-27 16:26:21,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:21,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:21,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648016815] [2019-12-27 16:26:21,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:21,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:21,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:26:21,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:21,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:21,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:21,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:21,866 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 16:26:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:27,971 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 16:26:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:27,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:26:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:28,752 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 16:26:28,753 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 16:26:28,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 16:26:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 16:26:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 16:26:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 16:26:37,328 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 16:26:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:37,329 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 16:26:37,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 16:26:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:26:37,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:37,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:37,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 16:26:37,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:37,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8637596] [2019-12-27 16:26:37,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:37,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8637596] [2019-12-27 16:26:37,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:37,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:37,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040187087] [2019-12-27 16:26:37,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:37,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:37,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:26:37,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:37,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:37,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:37,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:37,437 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 16:26:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:42,247 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 16:26:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:42,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:26:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:42,305 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 16:26:42,305 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 16:26:42,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 16:26:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 16:26:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 16:26:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 16:26:42,907 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 16:26:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:42,908 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 16:26:42,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 16:26:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:42,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:42,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:42,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 16:26:42,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:42,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832359779] [2019-12-27 16:26:42,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:42,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832359779] [2019-12-27 16:26:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030633746] [2019-12-27 16:26:42,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:42,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:42,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:42,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:42,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:42,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:42,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:42,984 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 16:26:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:43,212 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 16:26:43,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:43,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:26:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:43,323 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 16:26:43,323 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 16:26:43,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 16:26:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 16:26:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 16:26:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 16:26:44,660 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 16:26:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:44,661 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 16:26:44,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 16:26:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:44,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:44,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:44,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 16:26:44,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:44,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743499209] [2019-12-27 16:26:44,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:44,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743499209] [2019-12-27 16:26:44,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:44,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:44,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385269510] [2019-12-27 16:26:44,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:44,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:44,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:44,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:44,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:44,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:44,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:44,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:44,793 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 16:26:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:45,153 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 16:26:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:45,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:26:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:45,248 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 16:26:45,248 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 16:26:45,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 16:26:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 16:26:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:26:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 16:26:46,045 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 16:26:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:46,046 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 16:26:46,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 16:26:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:26:46,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:46,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:46,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 16:26:46,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:46,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927351631] [2019-12-27 16:26:46,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:46,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927351631] [2019-12-27 16:26:46,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:46,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:46,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766301771] [2019-12-27 16:26:46,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:46,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:46,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:26:46,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:46,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:46,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:46,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:46,119 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 16:26:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:46,497 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 16:26:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:46,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:26:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:46,600 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 16:26:46,601 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 16:26:46,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 16:26:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 16:26:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 16:26:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 16:26:47,836 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 16:26:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:47,837 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 16:26:47,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 16:26:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:26:47,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:47,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:47,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 16:26:47,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:47,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800256120] [2019-12-27 16:26:47,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:47,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800256120] [2019-12-27 16:26:47,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:47,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:47,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897138957] [2019-12-27 16:26:47,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:47,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:47,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:26:47,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:47,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:47,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:47,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:47,943 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 16:26:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:48,580 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 16:26:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:26:48,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:26:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:48,678 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 16:26:48,678 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 16:26:48,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 16:26:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 16:26:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 16:26:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 16:26:49,547 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 16:26:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:49,547 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 16:26:49,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 16:26:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:26:49,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:49,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:49,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 16:26:49,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:49,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656042790] [2019-12-27 16:26:49,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:49,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656042790] [2019-12-27 16:26:49,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:49,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:49,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47060565] [2019-12-27 16:26:49,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:49,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:49,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:26:49,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:49,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:49,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:49,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:49,642 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 16:26:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:50,565 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 16:26:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:26:50,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:26:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:50,666 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 16:26:50,666 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 16:26:50,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 16:26:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 16:26:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 16:26:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 16:26:51,525 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 16:26:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:51,525 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 16:26:51,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 16:26:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:26:51,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:51,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:51,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 16:26:51,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:51,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189402092] [2019-12-27 16:26:51,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:51,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189402092] [2019-12-27 16:26:51,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:51,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:51,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216135972] [2019-12-27 16:26:51,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:51,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:51,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:26:51,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:51,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:26:51,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:51,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:51,638 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 5 states. [2019-12-27 16:26:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:51,757 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 16:26:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:26:51,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:26:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:51,795 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 16:26:51,795 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 16:26:51,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 16:26:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 16:26:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 16:26:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 16:26:52,134 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 16:26:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:52,135 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 16:26:52,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 16:26:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:26:52,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:52,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] [2019-12-27 16:26:52,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 16:26:52,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:52,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771030861] [2019-12-27 16:26:52,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:52,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771030861] [2019-12-27 16:26:52,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:52,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:52,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594797226] [2019-12-27 16:26:52,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:52,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:52,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:26:52,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:52,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:52,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:52,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:52,225 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 16:26:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:52,581 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 16:26:52,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:52,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:26:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:52,612 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 16:26:52,612 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 16:26:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 16:26:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 16:26:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 16:26:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 16:26:52,915 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 16:26:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:52,916 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 16:26:52,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 16:26:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:26:52,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:52,930 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] [2019-12-27 16:26:52,931 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 16:26:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:52,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226435431] [2019-12-27 16:26:52,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:53,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226435431] [2019-12-27 16:26:53,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:53,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:53,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923027710] [2019-12-27 16:26:53,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:53,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:53,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:26:53,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:53,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:53,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:26:53,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:26:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:26:53,141 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 16:26:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:53,534 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 16:26:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:26:53,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:26:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:53,582 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 16:26:53,582 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 16:26:53,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 16:26:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 16:26:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 16:26:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 16:26:53,938 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 16:26:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:53,938 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 16:26:53,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:26:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 16:26:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:26:53,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:53,957 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] [2019-12-27 16:26:53,957 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 16:26:53,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:53,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933731953] [2019-12-27 16:26:53,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:54,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933731953] [2019-12-27 16:26:54,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:54,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:54,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876829672] [2019-12-27 16:26:54,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:54,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:54,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 16:26:54,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:54,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:54,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:54,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:54,157 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 7 states. [2019-12-27 16:26:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:54,908 INFO L93 Difference]: Finished difference Result 28860 states and 86218 transitions. [2019-12-27 16:26:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:26:54,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 16:26:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:54,956 INFO L225 Difference]: With dead ends: 28860 [2019-12-27 16:26:54,956 INFO L226 Difference]: Without dead ends: 28860 [2019-12-27 16:26:54,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:26:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28860 states. [2019-12-27 16:26:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28860 to 21822. [2019-12-27 16:26:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21822 states. [2019-12-27 16:26:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21822 states to 21822 states and 66391 transitions. [2019-12-27 16:26:55,335 INFO L78 Accepts]: Start accepts. Automaton has 21822 states and 66391 transitions. Word has length 32 [2019-12-27 16:26:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:55,335 INFO L462 AbstractCegarLoop]: Abstraction has 21822 states and 66391 transitions. [2019-12-27 16:26:55,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:26:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 21822 states and 66391 transitions. [2019-12-27 16:26:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:26:55,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:55,359 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] [2019-12-27 16:26:55,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 16:26:55,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:55,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380546515] [2019-12-27 16:26:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:55,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380546515] [2019-12-27 16:26:55,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [245955359] [2019-12-27 16:26:55,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:55,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:55,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 94 transitions. [2019-12-27 16:26:55,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:55,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:26:55,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:55,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:55,483 INFO L87 Difference]: Start difference. First operand 21822 states and 66391 transitions. Second operand 6 states. [2019-12-27 16:26:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:56,197 INFO L93 Difference]: Finished difference Result 29045 states and 86925 transitions. [2019-12-27 16:26:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:26:56,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 16:26:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:56,241 INFO L225 Difference]: With dead ends: 29045 [2019-12-27 16:26:56,241 INFO L226 Difference]: Without dead ends: 29045 [2019-12-27 16:26:56,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:26:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29045 states. [2019-12-27 16:26:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29045 to 21326. [2019-12-27 16:26:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21326 states. [2019-12-27 16:26:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21326 states to 21326 states and 65148 transitions. [2019-12-27 16:26:56,643 INFO L78 Accepts]: Start accepts. Automaton has 21326 states and 65148 transitions. Word has length 34 [2019-12-27 16:26:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:56,643 INFO L462 AbstractCegarLoop]: Abstraction has 21326 states and 65148 transitions. [2019-12-27 16:26:56,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21326 states and 65148 transitions. [2019-12-27 16:26:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 16:26:56,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:56,663 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] [2019-12-27 16:26:56,663 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -294288994, now seen corresponding path program 1 times [2019-12-27 16:26:56,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:56,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647478163] [2019-12-27 16:26:56,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:56,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647478163] [2019-12-27 16:26:56,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:56,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:26:56,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1786622148] [2019-12-27 16:26:56,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:56,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:56,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 134 transitions. [2019-12-27 16:26:56,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:56,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:26:56,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:56,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:56,999 INFO L87 Difference]: Start difference. First operand 21326 states and 65148 transitions. Second operand 9 states. [2019-12-27 16:26:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:58,684 INFO L93 Difference]: Finished difference Result 39629 states and 117182 transitions. [2019-12-27 16:26:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:26:58,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 16:26:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:58,748 INFO L225 Difference]: With dead ends: 39629 [2019-12-27 16:26:58,748 INFO L226 Difference]: Without dead ends: 39629 [2019-12-27 16:26:58,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:26:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39629 states. [2019-12-27 16:26:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39629 to 17844. [2019-12-27 16:26:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17844 states. [2019-12-27 16:26:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17844 states to 17844 states and 54566 transitions. [2019-12-27 16:26:59,169 INFO L78 Accepts]: Start accepts. Automaton has 17844 states and 54566 transitions. Word has length 36 [2019-12-27 16:26:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:59,169 INFO L462 AbstractCegarLoop]: Abstraction has 17844 states and 54566 transitions. [2019-12-27 16:26:59,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17844 states and 54566 transitions. [2019-12-27 16:26:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:26:59,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:59,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:59,187 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 16:26:59,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:59,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107258804] [2019-12-27 16:26:59,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:59,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107258804] [2019-12-27 16:26:59,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:59,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:26:59,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296051970] [2019-12-27 16:26:59,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:59,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:59,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 16:26:59,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:59,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:59,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:59,326 INFO L87 Difference]: Start difference. First operand 17844 states and 54566 transitions. Second operand 3 states. [2019-12-27 16:26:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:59,393 INFO L93 Difference]: Finished difference Result 17843 states and 54564 transitions. [2019-12-27 16:26:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:59,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:26:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:59,419 INFO L225 Difference]: With dead ends: 17843 [2019-12-27 16:26:59,419 INFO L226 Difference]: Without dead ends: 17843 [2019-12-27 16:26:59,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17843 states. [2019-12-27 16:26:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17843 to 17843. [2019-12-27 16:26:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2019-12-27 16:26:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 54564 transitions. [2019-12-27 16:26:59,681 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 54564 transitions. Word has length 39 [2019-12-27 16:26:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:59,682 INFO L462 AbstractCegarLoop]: Abstraction has 17843 states and 54564 transitions. [2019-12-27 16:26:59,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 54564 transitions. [2019-12-27 16:26:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:26:59,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:59,704 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] [2019-12-27 16:26:59,704 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:59,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 16:26:59,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:59,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992346508] [2019-12-27 16:26:59,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:59,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992346508] [2019-12-27 16:26:59,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:59,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:26:59,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978390186] [2019-12-27 16:26:59,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:59,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:59,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 16:26:59,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:59,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:59,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:26:59,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:26:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:59,969 INFO L87 Difference]: Start difference. First operand 17843 states and 54564 transitions. Second operand 7 states. [2019-12-27 16:27:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:00,760 INFO L93 Difference]: Finished difference Result 25586 states and 77360 transitions. [2019-12-27 16:27:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:27:00,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:27:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:00,805 INFO L225 Difference]: With dead ends: 25586 [2019-12-27 16:27:00,805 INFO L226 Difference]: Without dead ends: 25586 [2019-12-27 16:27:00,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:27:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25586 states. [2019-12-27 16:27:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25586 to 23742. [2019-12-27 16:27:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23742 states. [2019-12-27 16:27:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 72302 transitions. [2019-12-27 16:27:01,514 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 72302 transitions. Word has length 40 [2019-12-27 16:27:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:01,514 INFO L462 AbstractCegarLoop]: Abstraction has 23742 states and 72302 transitions. [2019-12-27 16:27:01,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:27:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 72302 transitions. [2019-12-27 16:27:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:27:01,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:01,547 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] [2019-12-27 16:27:01,547 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 16:27:01,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:01,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805488410] [2019-12-27 16:27:01,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:01,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805488410] [2019-12-27 16:27:01,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:01,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:27:01,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1128720849] [2019-12-27 16:27:01,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:01,616 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:01,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:27:01,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:01,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:27:01,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:27:01,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:01,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:27:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:27:01,757 INFO L87 Difference]: Start difference. First operand 23742 states and 72302 transitions. Second operand 7 states. [2019-12-27 16:27:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:01,858 INFO L93 Difference]: Finished difference Result 22357 states and 69069 transitions. [2019-12-27 16:27:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:01,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:27:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:01,890 INFO L225 Difference]: With dead ends: 22357 [2019-12-27 16:27:01,890 INFO L226 Difference]: Without dead ends: 22357 [2019-12-27 16:27:01,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:27:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22357 states. [2019-12-27 16:27:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22357 to 21433. [2019-12-27 16:27:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-12-27 16:27:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 66576 transitions. [2019-12-27 16:27:02,211 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 66576 transitions. Word has length 40 [2019-12-27 16:27:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:02,212 INFO L462 AbstractCegarLoop]: Abstraction has 21433 states and 66576 transitions. [2019-12-27 16:27:02,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:27:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 66576 transitions. [2019-12-27 16:27:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:02,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:02,234 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] [2019-12-27 16:27:02,234 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 16:27:02,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:02,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836929124] [2019-12-27 16:27:02,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:02,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836929124] [2019-12-27 16:27:02,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:02,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:27:02,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070068790] [2019-12-27 16:27:02,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:02,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:02,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 476 transitions. [2019-12-27 16:27:02,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:02,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:27:02,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:27:02,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:02,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:27:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:27:02,548 INFO L87 Difference]: Start difference. First operand 21433 states and 66576 transitions. Second operand 7 states. [2019-12-27 16:27:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:03,089 INFO L93 Difference]: Finished difference Result 61846 states and 190827 transitions. [2019-12-27 16:27:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:27:03,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:27:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:03,155 INFO L225 Difference]: With dead ends: 61846 [2019-12-27 16:27:03,155 INFO L226 Difference]: Without dead ends: 47493 [2019-12-27 16:27:03,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:27:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47493 states. [2019-12-27 16:27:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47493 to 24866. [2019-12-27 16:27:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24866 states. [2019-12-27 16:27:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24866 states to 24866 states and 77717 transitions. [2019-12-27 16:27:03,695 INFO L78 Accepts]: Start accepts. Automaton has 24866 states and 77717 transitions. Word has length 63 [2019-12-27 16:27:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:03,696 INFO L462 AbstractCegarLoop]: Abstraction has 24866 states and 77717 transitions. [2019-12-27 16:27:03,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:27:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24866 states and 77717 transitions. [2019-12-27 16:27:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:03,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:03,721 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] [2019-12-27 16:27:03,721 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 16:27:03,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:03,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292007085] [2019-12-27 16:27:03,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:03,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292007085] [2019-12-27 16:27:03,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:03,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:27:03,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504070012] [2019-12-27 16:27:03,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:04,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:04,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 553 transitions. [2019-12-27 16:27:04,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:04,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:27:04,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:27:04,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:27:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:27:04,353 INFO L87 Difference]: Start difference. First operand 24866 states and 77717 transitions. Second operand 9 states. [2019-12-27 16:27:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:06,720 INFO L93 Difference]: Finished difference Result 79052 states and 243780 transitions. [2019-12-27 16:27:06,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:27:06,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:27:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:06,881 INFO L225 Difference]: With dead ends: 79052 [2019-12-27 16:27:06,881 INFO L226 Difference]: Without dead ends: 58725 [2019-12-27 16:27:06,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:27:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58725 states. [2019-12-27 16:27:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58725 to 28731. [2019-12-27 16:27:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28731 states. [2019-12-27 16:27:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28731 states to 28731 states and 89455 transitions. [2019-12-27 16:27:07,765 INFO L78 Accepts]: Start accepts. Automaton has 28731 states and 89455 transitions. Word has length 63 [2019-12-27 16:27:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:07,765 INFO L462 AbstractCegarLoop]: Abstraction has 28731 states and 89455 transitions. [2019-12-27 16:27:07,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:27:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 28731 states and 89455 transitions. [2019-12-27 16:27:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:07,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:07,795 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] [2019-12-27 16:27:07,795 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 16:27:07,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:07,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346611128] [2019-12-27 16:27:07,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346611128] [2019-12-27 16:27:07,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:07,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:27:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143393123] [2019-12-27 16:27:07,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:07,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:08,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 398 transitions. [2019-12-27 16:27:08,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:08,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:27:08,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:27:08,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:27:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:27:08,476 INFO L87 Difference]: Start difference. First operand 28731 states and 89455 transitions. Second operand 8 states. [2019-12-27 16:27:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:10,109 INFO L93 Difference]: Finished difference Result 80436 states and 245375 transitions. [2019-12-27 16:27:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:27:10,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 16:27:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:10,219 INFO L225 Difference]: With dead ends: 80436 [2019-12-27 16:27:10,219 INFO L226 Difference]: Without dead ends: 71300 [2019-12-27 16:27:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:27:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71300 states. [2019-12-27 16:27:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71300 to 29039. [2019-12-27 16:27:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29039 states. [2019-12-27 16:27:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29039 states to 29039 states and 90406 transitions. [2019-12-27 16:27:10,987 INFO L78 Accepts]: Start accepts. Automaton has 29039 states and 90406 transitions. Word has length 63 [2019-12-27 16:27:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:10,987 INFO L462 AbstractCegarLoop]: Abstraction has 29039 states and 90406 transitions. [2019-12-27 16:27:10,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:27:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29039 states and 90406 transitions. [2019-12-27 16:27:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:11,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:11,016 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] [2019-12-27 16:27:11,016 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 16:27:11,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:11,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770736595] [2019-12-27 16:27:11,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:11,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770736595] [2019-12-27 16:27:11,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:11,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:27:11,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528602994] [2019-12-27 16:27:11,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:11,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:11,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 403 transitions. [2019-12-27 16:27:11,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:11,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:27:11,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:27:11,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:11,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:27:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:27:11,511 INFO L87 Difference]: Start difference. First operand 29039 states and 90406 transitions. Second operand 7 states. [2019-12-27 16:27:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:12,838 INFO L93 Difference]: Finished difference Result 38027 states and 116042 transitions. [2019-12-27 16:27:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:27:12,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:27:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:12,892 INFO L225 Difference]: With dead ends: 38027 [2019-12-27 16:27:12,892 INFO L226 Difference]: Without dead ends: 37803 [2019-12-27 16:27:12,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:27:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37803 states. [2019-12-27 16:27:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37803 to 31827. [2019-12-27 16:27:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31827 states. [2019-12-27 16:27:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31827 states to 31827 states and 98705 transitions. [2019-12-27 16:27:13,438 INFO L78 Accepts]: Start accepts. Automaton has 31827 states and 98705 transitions. Word has length 63 [2019-12-27 16:27:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:13,438 INFO L462 AbstractCegarLoop]: Abstraction has 31827 states and 98705 transitions. [2019-12-27 16:27:13,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:27:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31827 states and 98705 transitions. [2019-12-27 16:27:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:27:13,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:13,481 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] [2019-12-27 16:27:13,481 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 16:27:13,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:13,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627867031] [2019-12-27 16:27:13,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:13,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627867031] [2019-12-27 16:27:13,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:13,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:13,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050960648] [2019-12-27 16:27:13,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:13,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:13,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 357 transitions. [2019-12-27 16:27:13,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:13,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:13,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:13,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:13,751 INFO L87 Difference]: Start difference. First operand 31827 states and 98705 transitions. Second operand 3 states. [2019-12-27 16:27:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:13,859 INFO L93 Difference]: Finished difference Result 31826 states and 98703 transitions. [2019-12-27 16:27:13,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:13,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 16:27:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:13,908 INFO L225 Difference]: With dead ends: 31826 [2019-12-27 16:27:13,908 INFO L226 Difference]: Without dead ends: 31826 [2019-12-27 16:27:13,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31826 states. [2019-12-27 16:27:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31826 to 27597. [2019-12-27 16:27:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27597 states. [2019-12-27 16:27:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27597 states to 27597 states and 86591 transitions. [2019-12-27 16:27:14,385 INFO L78 Accepts]: Start accepts. Automaton has 27597 states and 86591 transitions. Word has length 63 [2019-12-27 16:27:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:14,385 INFO L462 AbstractCegarLoop]: Abstraction has 27597 states and 86591 transitions. [2019-12-27 16:27:14,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27597 states and 86591 transitions. [2019-12-27 16:27:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:27:14,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:14,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:14,415 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 16:27:14,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:14,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559145626] [2019-12-27 16:27:14,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:14,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559145626] [2019-12-27 16:27:14,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:14,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:27:14,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376449808] [2019-12-27 16:27:14,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:14,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:14,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 341 transitions. [2019-12-27 16:27:14,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:14,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:27:14,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:14,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:14,805 INFO L87 Difference]: Start difference. First operand 27597 states and 86591 transitions. Second operand 4 states. [2019-12-27 16:27:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:15,283 INFO L93 Difference]: Finished difference Result 32689 states and 101784 transitions. [2019-12-27 16:27:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:15,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 16:27:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:15,358 INFO L225 Difference]: With dead ends: 32689 [2019-12-27 16:27:15,358 INFO L226 Difference]: Without dead ends: 32689 [2019-12-27 16:27:15,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32689 states. [2019-12-27 16:27:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32689 to 28171. [2019-12-27 16:27:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28171 states. [2019-12-27 16:27:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28171 states to 28171 states and 88570 transitions. [2019-12-27 16:27:15,918 INFO L78 Accepts]: Start accepts. Automaton has 28171 states and 88570 transitions. Word has length 64 [2019-12-27 16:27:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:15,918 INFO L462 AbstractCegarLoop]: Abstraction has 28171 states and 88570 transitions. [2019-12-27 16:27:15,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:27:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28171 states and 88570 transitions. [2019-12-27 16:27:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:27:15,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:15,955 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-27 16:27:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:15,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663325861] [2019-12-27 16:27:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663325861] [2019-12-27 16:27:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:16,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364956336] [2019-12-27 16:27:16,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:16,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:16,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 338 transitions. [2019-12-27 16:27:16,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:16,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:27:16,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:16,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:16,246 INFO L87 Difference]: Start difference. First operand 28171 states and 88570 transitions. Second operand 4 states. [2019-12-27 16:27:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:16,528 INFO L93 Difference]: Finished difference Result 32449 states and 99629 transitions. [2019-12-27 16:27:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:16,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:27:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:16,575 INFO L225 Difference]: With dead ends: 32449 [2019-12-27 16:27:16,576 INFO L226 Difference]: Without dead ends: 32449 [2019-12-27 16:27:16,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:27:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32449 states. [2019-12-27 16:27:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32449 to 22466. [2019-12-27 16:27:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22466 states. [2019-12-27 16:27:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22466 states to 22466 states and 69571 transitions. [2019-12-27 16:27:16,989 INFO L78 Accepts]: Start accepts. Automaton has 22466 states and 69571 transitions. Word has length 65 [2019-12-27 16:27:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:16,989 INFO L462 AbstractCegarLoop]: Abstraction has 22466 states and 69571 transitions. [2019-12-27 16:27:16,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:27:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22466 states and 69571 transitions. [2019-12-27 16:27:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:17,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:17,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:17,016 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 16:27:17,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:17,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10428094] [2019-12-27 16:27:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:17,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10428094] [2019-12-27 16:27:17,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412287960] [2019-12-27 16:27:17,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:17,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:17,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 325 states and 657 transitions. [2019-12-27 16:27:17,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:18,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:27:18,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:27:18,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:27:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:27:18,077 INFO L87 Difference]: Start difference. First operand 22466 states and 69571 transitions. Second operand 13 states. [2019-12-27 16:27:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:20,119 INFO L93 Difference]: Finished difference Result 48576 states and 150561 transitions. [2019-12-27 16:27:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 16:27:20,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 16:27:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:20,184 INFO L225 Difference]: With dead ends: 48576 [2019-12-27 16:27:20,184 INFO L226 Difference]: Without dead ends: 46040 [2019-12-27 16:27:20,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:27:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46040 states. [2019-12-27 16:27:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46040 to 27175. [2019-12-27 16:27:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27175 states. [2019-12-27 16:27:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27175 states to 27175 states and 84070 transitions. [2019-12-27 16:27:20,716 INFO L78 Accepts]: Start accepts. Automaton has 27175 states and 84070 transitions. Word has length 66 [2019-12-27 16:27:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:20,717 INFO L462 AbstractCegarLoop]: Abstraction has 27175 states and 84070 transitions. [2019-12-27 16:27:20,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:27:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 27175 states and 84070 transitions. [2019-12-27 16:27:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:20,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:20,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:20,743 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-27 16:27:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:20,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233872930] [2019-12-27 16:27:20,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:20,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233872930] [2019-12-27 16:27:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356694359] [2019-12-27 16:27:20,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:20,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:21,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 397 states and 834 transitions. [2019-12-27 16:27:21,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:21,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:27:21,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:27:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:27:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:27:21,521 INFO L87 Difference]: Start difference. First operand 27175 states and 84070 transitions. Second operand 14 states. [2019-12-27 16:27:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:24,593 INFO L93 Difference]: Finished difference Result 58807 states and 180546 transitions. [2019-12-27 16:27:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:27:24,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:27:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:24,669 INFO L225 Difference]: With dead ends: 58807 [2019-12-27 16:27:24,670 INFO L226 Difference]: Without dead ends: 49756 [2019-12-27 16:27:24,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 16:27:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49756 states. [2019-12-27 16:27:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49756 to 22104. [2019-12-27 16:27:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22104 states. [2019-12-27 16:27:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22104 states to 22104 states and 67923 transitions. [2019-12-27 16:27:25,197 INFO L78 Accepts]: Start accepts. Automaton has 22104 states and 67923 transitions. Word has length 66 [2019-12-27 16:27:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:25,197 INFO L462 AbstractCegarLoop]: Abstraction has 22104 states and 67923 transitions. [2019-12-27 16:27:25,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:27:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22104 states and 67923 transitions. [2019-12-27 16:27:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:25,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:25,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:25,222 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-27 16:27:25,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:25,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312096236] [2019-12-27 16:27:25,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:25,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312096236] [2019-12-27 16:27:25,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:25,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:27:25,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469060969] [2019-12-27 16:27:25,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:25,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:26,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 668 transitions. [2019-12-27 16:27:26,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:26,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 16:27:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:27:26,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:27:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:27:26,812 INFO L87 Difference]: Start difference. First operand 22104 states and 67923 transitions. Second operand 21 states. [2019-12-27 16:27:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:31,713 INFO L93 Difference]: Finished difference Result 28781 states and 87277 transitions. [2019-12-27 16:27:31,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:27:31,714 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 16:27:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:31,754 INFO L225 Difference]: With dead ends: 28781 [2019-12-27 16:27:31,754 INFO L226 Difference]: Without dead ends: 27936 [2019-12-27 16:27:31,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 16:27:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27936 states. [2019-12-27 16:27:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27936 to 21574. [2019-12-27 16:27:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21574 states. [2019-12-27 16:27:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 66451 transitions. [2019-12-27 16:27:32,149 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 66451 transitions. Word has length 66 [2019-12-27 16:27:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:32,149 INFO L462 AbstractCegarLoop]: Abstraction has 21574 states and 66451 transitions. [2019-12-27 16:27:32,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:27:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 66451 transitions. [2019-12-27 16:27:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:32,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:32,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:32,174 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 4 times [2019-12-27 16:27:32,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:32,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917782890] [2019-12-27 16:27:32,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:32,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:27:32,296 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:27:32,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t669~0.base_22| 4)) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22| 1) |v_#valid_69|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22|)) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t669~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22|) |v_ULTIMATE.start_main_~#t669~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t669~0.base_22|) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t669~0.base=|v_ULTIMATE.start_main_~#t669~0.base_22|, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~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_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t669~0.offset=|v_ULTIMATE.start_main_~#t669~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t670~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t670~0.base, ~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_~#t669~0.base, ~x~0, ULTIMATE.start_main_~#t671~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t669~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:32,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:32,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11|) |v_ULTIMATE.start_main_~#t670~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t670~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t670~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t670~0.base_11|) (= |v_ULTIMATE.start_main_~#t670~0.offset_10| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t670~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t670~0.offset] because there is no mapped edge [2019-12-27 16:27:32,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t671~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t671~0.base_12| 4)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t671~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12|) |v_ULTIMATE.start_main_~#t671~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t671~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.offset, ULTIMATE.start_main_~#t671~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 16:27:32,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-313454687 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-313454687 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-313454687| |P1Thread1of1ForFork2_#t~ite9_Out-313454687|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-313454687 |P1Thread1of1ForFork2_#t~ite9_Out-313454687|)) (and (= ~z$w_buff1~0_In-313454687 |P1Thread1of1ForFork2_#t~ite9_Out-313454687|) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-313454687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313454687, ~z$w_buff1~0=~z$w_buff1~0_In-313454687, ~z~0=~z~0_In-313454687} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-313454687|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-313454687, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-313454687|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313454687, ~z$w_buff1~0=~z$w_buff1~0_In-313454687, ~z~0=~z~0_In-313454687} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:27:32,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1959115454 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In-1959115454 |P2Thread1of1ForFork0_#t~ite23_Out-1959115454|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1959115454 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1959115454 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-1959115454 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1959115454 256))))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1959115454| |P2Thread1of1ForFork0_#t~ite23_Out-1959115454|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-1959115454| |P2Thread1of1ForFork0_#t~ite23_Out-1959115454|) (= ~z$w_buff1~0_In-1959115454 |P2Thread1of1ForFork0_#t~ite24_Out-1959115454|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959115454, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1959115454, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1959115454|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959115454, ~z$w_buff1~0=~z$w_buff1~0_In-1959115454, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1959115454, ~weak$$choice2~0=~weak$$choice2~0_In-1959115454} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959115454, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1959115454|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1959115454, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1959115454|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959115454, ~z$w_buff1~0=~z$w_buff1~0_In-1959115454, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1959115454, ~weak$$choice2~0=~weak$$choice2~0_In-1959115454} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:27:32,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-252801146 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-252801146| |P2Thread1of1ForFork0_#t~ite30_Out-252801146|)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-252801146 256))) (.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In-252801146 256))) (.cse4 (= (mod ~z$w_buff1_used~0_In-252801146 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-252801146 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In-252801146| |P2Thread1of1ForFork0_#t~ite28_Out-252801146|) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-252801146| ~z$w_buff1_used~0_In-252801146) .cse1 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5))) (and (not .cse0) (= ~z$w_buff1_used~0_In-252801146 |P2Thread1of1ForFork0_#t~ite30_Out-252801146|) (= |P2Thread1of1ForFork0_#t~ite29_Out-252801146| |P2Thread1of1ForFork0_#t~ite29_In-252801146|)))) (let ((.cse6 (not .cse3))) (and .cse0 .cse1 (not .cse2) (or .cse6 (not .cse5)) (= |P2Thread1of1ForFork0_#t~ite29_Out-252801146| |P2Thread1of1ForFork0_#t~ite28_Out-252801146|) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-252801146|) (or .cse6 (not .cse4)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-252801146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-252801146, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-252801146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252801146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-252801146, ~weak$$choice2~0=~weak$$choice2~0_In-252801146, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-252801146|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-252801146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-252801146, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-252801146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252801146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-252801146, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-252801146|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-252801146|, ~weak$$choice2~0=~weak$$choice2~0_In-252801146} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:32,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:32,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:27:32,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In315714264 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out315714264| |P2Thread1of1ForFork0_#t~ite38_Out315714264|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In315714264 256)))) (or (and (= ~z~0_In315714264 |P2Thread1of1ForFork0_#t~ite38_Out315714264|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= ~z$w_buff1~0_In315714264 |P2Thread1of1ForFork0_#t~ite38_Out315714264|) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In315714264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315714264, ~z$w_buff1~0=~z$w_buff1~0_In315714264, ~z~0=~z~0_In315714264} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out315714264|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out315714264|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In315714264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315714264, ~z$w_buff1~0=~z$w_buff1~0_In315714264, ~z~0=~z~0_In315714264} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:27:32,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1945297980 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1945297980 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1945297980| ~z$w_buff0_used~0_In-1945297980)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1945297980| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1945297980, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1945297980} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1945297980, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1945297980|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1945297980} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:27:32,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1583968852 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1583968852 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1583968852 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1583968852 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1583968852| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1583968852| ~z$w_buff1_used~0_In-1583968852) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1583968852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1583968852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1583968852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1583968852} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1583968852, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1583968852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1583968852, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1583968852, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1583968852|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:27:32,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1651273963 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1651273963 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1651273963| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1651273963| ~z$r_buff0_thd3~0_In1651273963)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1651273963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1651273963} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1651273963, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1651273963, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1651273963|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:27:32,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1784656518 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1784656518 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1784656518 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1784656518 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1784656518| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1784656518 |P2Thread1of1ForFork0_#t~ite43_Out1784656518|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1784656518, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1784656518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784656518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1784656518} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1784656518|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784656518, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1784656518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784656518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1784656518} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:27:32,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:27:32,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-195662155 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-195662155 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-195662155 |P0Thread1of1ForFork1_#t~ite5_Out-195662155|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-195662155| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-195662155, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-195662155} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-195662155|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-195662155, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-195662155} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:27:32,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2026279492 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In2026279492 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In2026279492 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2026279492 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out2026279492| ~z$w_buff1_used~0_In2026279492) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out2026279492| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2026279492, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2026279492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2026279492, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2026279492} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2026279492, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2026279492|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2026279492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2026279492, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2026279492} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:27:32,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1567412408 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1567412408 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1567412408 ~z$r_buff0_thd1~0_In1567412408)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1567412408)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1567412408, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1567412408} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1567412408, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1567412408|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1567412408} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:32,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-689641805 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-689641805 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-689641805 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-689641805 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-689641805|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-689641805| ~z$r_buff1_thd1~0_In-689641805) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-689641805, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-689641805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-689641805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-689641805} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-689641805|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-689641805, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-689641805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-689641805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-689641805} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:27:32,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:27:32,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In783452587 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In783452587 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In783452587 |P1Thread1of1ForFork2_#t~ite11_Out783452587|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out783452587|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In783452587, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In783452587} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In783452587, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out783452587|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In783452587} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:27:32,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1118129127 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1118129127 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1118129127 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1118129127 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1118129127|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1118129127 |P1Thread1of1ForFork2_#t~ite12_Out-1118129127|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118129127, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1118129127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118129127, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1118129127} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118129127, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1118129127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1118129127, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1118129127|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1118129127} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:27:32,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1714078625 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1714078625 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1714078625|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1714078625 |P1Thread1of1ForFork2_#t~ite13_Out1714078625|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1714078625, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1714078625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1714078625, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1714078625|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1714078625} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:27:32,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1306559427 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1306559427 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1306559427 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1306559427 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1306559427|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1306559427 |P1Thread1of1ForFork2_#t~ite14_Out1306559427|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1306559427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1306559427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1306559427, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1306559427} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1306559427, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1306559427, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1306559427, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1306559427|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1306559427} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:27:32,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:27:32,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:27:32,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1126954202 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1126954202 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1126954202| ~z~0_In1126954202) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out1126954202| ~z$w_buff1~0_In1126954202) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1126954202, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126954202, ~z$w_buff1~0=~z$w_buff1~0_In1126954202, ~z~0=~z~0_In1126954202} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1126954202, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1126954202|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126954202, ~z$w_buff1~0=~z$w_buff1~0_In1126954202, ~z~0=~z~0_In1126954202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:27:32,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:27:32,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1732655691 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1732655691 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1732655691|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1732655691 |ULTIMATE.start_main_#t~ite49_Out-1732655691|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1732655691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1732655691} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1732655691, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1732655691, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1732655691|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:27:32,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In9138780 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In9138780 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In9138780 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In9138780 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out9138780| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In9138780 |ULTIMATE.start_main_#t~ite50_Out9138780|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9138780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9138780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9138780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9138780} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out9138780|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9138780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9138780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9138780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9138780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:27:32,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1214623554 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1214623554 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1214623554|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1214623554 |ULTIMATE.start_main_#t~ite51_Out1214623554|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1214623554, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1214623554} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1214623554, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1214623554|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1214623554} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:27:32,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1156161426 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1156161426 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1156161426 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1156161426 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1156161426|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1156161426 |ULTIMATE.start_main_#t~ite52_Out1156161426|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156161426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156161426, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1156161426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1156161426} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1156161426|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156161426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156161426, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1156161426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1156161426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:27:32,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:27:32,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:27:32 BasicIcfg [2019-12-27 16:27:32,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:27:32,411 INFO L168 Benchmark]: Toolchain (without parser) took 116307.98 ms. Allocated memory was 145.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,411 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:27:32,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.35 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,413 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,413 INFO L168 Benchmark]: RCFGBuilder took 860.16 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 102.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,414 INFO L168 Benchmark]: TraceAbstraction took 114493.37 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:32,419 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.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.35 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.19 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.16 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 102.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114493.37 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t669, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p2_EAX=0, __unbuffered_p2_EBX=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] [L827] FCALL, FORK 0 pthread_create(&t670, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t671, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 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) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$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)) [L792] 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)) [L793] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_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))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L796] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, 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] [L802] 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) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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: 114.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6623 SDtfs, 7542 SDslu, 23203 SDs, 0 SdLazy, 15717 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 126 SyntacticMatches, 63 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 37.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 293517 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1127 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 186560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...