/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:24:42,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:24:42,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:24:42,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:24:42,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:24:42,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:24:42,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:24:42,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:24:42,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:24:42,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:24:42,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:24:42,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:24:42,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:24:42,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:24:42,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:24:42,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:24:42,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:24:42,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:24:42,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:24:42,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:24:42,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:24:42,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:24:42,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:24:42,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:24:42,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:24:42,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:24:42,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:24:42,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:24:42,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:24:42,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:24:42,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:24:42,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:24:42,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:24:42,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:24:42,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:24:42,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:24:42,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:24:42,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:24:42,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:24:42,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:24:42,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:24:42,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:24:42,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:24:42,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:24:42,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:24:42,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:24:42,865 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:24:42,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:24:42,865 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:24:42,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:24:42,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:24:42,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:24:42,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:24:42,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:24:42,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:24:42,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:24:42,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:24:42,868 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:24:42,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:24:42,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:24:42,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:24:42,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:24:42,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:24:42,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:42,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:24:42,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:24:42,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:24:42,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:24:42,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:24:42,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:24:42,871 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:24:42,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:24:43,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:24:43,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:24:43,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:24:43,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:24:43,185 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:24:43,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-18 13:24:43,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e932fc31/887bc1f097c54e6fb05b1c87ece716d6/FLAGe1683d1ee [2019-12-18 13:24:43,813 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:24:43,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-18 13:24:43,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e932fc31/887bc1f097c54e6fb05b1c87ece716d6/FLAGe1683d1ee [2019-12-18 13:24:44,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e932fc31/887bc1f097c54e6fb05b1c87ece716d6 [2019-12-18 13:24:44,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:24:44,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:24:44,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:44,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:24:44,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:24:44,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44, skipping insertion in model container [2019-12-18 13:24:44,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:24:44,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:24:44,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:44,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:24:44,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:44,908 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:24:44,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44 WrapperNode [2019-12-18 13:24:44,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:44,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:44,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:24:44,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:24:44,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:44,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:24:44,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:24:44,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:24:44,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:44,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:45,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:45,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:45,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... [2019-12-18 13:24:45,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:24:45,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:24:45,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:24:45,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:24:45,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:24:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:24:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:24:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:24:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:24:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:24:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:24:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:24:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:24:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:24:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:24:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:24:45,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:24:45,104 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:24:45,858 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:24:45,858 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:24:45,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:45 BoogieIcfgContainer [2019-12-18 13:24:45,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:24:45,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:24:45,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:24:45,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:24:45,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:24:44" (1/3) ... [2019-12-18 13:24:45,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a77409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:45, skipping insertion in model container [2019-12-18 13:24:45,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:44" (2/3) ... [2019-12-18 13:24:45,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a77409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:45, skipping insertion in model container [2019-12-18 13:24:45,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:45" (3/3) ... [2019-12-18 13:24:45,869 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-18 13:24:45,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:24:45,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:24:45,893 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:24:45,894 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:24:45,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:46,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:24:46,088 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:24:46,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:24:46,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:24:46,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:24:46,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:24:46,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:24:46,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:24:46,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:24:46,105 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:24:46,106 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:46,199 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:46,199 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:46,222 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:46,251 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:46,299 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:46,299 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:46,307 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:46,329 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:24:46,330 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:24:51,939 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:24:52,294 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:24:52,418 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:24:52,449 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:24:52,450 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:24:52,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:25:06,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:25:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:25:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:25:06,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:06,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:25:06,643 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:25:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:06,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981588613] [2019-12-18 13:25:06,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:06,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981588613] [2019-12-18 13:25:06,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:06,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:25:06,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568953677] [2019-12-18 13:25:06,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:06,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:06,975 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:25:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:09,922 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:25:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:09,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:25:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:10,524 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:25:10,524 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:25:10,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:25:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:25:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:25:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:25:22,366 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:25:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:22,366 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:25:22,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:25:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:25:22,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:22,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:22,371 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:22,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:25:22,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:22,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24409684] [2019-12-18 13:25:22,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:22,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24409684] [2019-12-18 13:25:22,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:22,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:22,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51753546] [2019-12-18 13:25:22,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:22,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:22,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:22,535 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:25:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:23,610 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:25:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:23,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:25:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:28,492 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:25:28,492 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:25:28,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:25:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:25:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:25:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:25:35,347 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:25:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:35,347 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:25:35,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:25:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:25:35,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:35,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:35,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:25:35,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614305254] [2019-12-18 13:25:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:40,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614305254] [2019-12-18 13:25:40,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:40,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:40,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72582196] [2019-12-18 13:25:40,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:40,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:40,025 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:25:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:40,164 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:25:40,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:40,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:25:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:40,220 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:25:40,221 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:25:40,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:25:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:25:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:25:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:25:40,808 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:25:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:40,808 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:25:40,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:25:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:25:40,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:40,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:40,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:25:40,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:40,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895111420] [2019-12-18 13:25:40,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:40,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895111420] [2019-12-18 13:25:40,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:40,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:40,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449306137] [2019-12-18 13:25:40,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:40,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:40,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:40,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:40,900 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:25:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:41,289 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:25:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:41,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:25:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:41,355 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:25:41,356 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:25:41,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:25:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:25:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:25:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:25:42,162 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:25:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:42,163 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:25:42,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:25:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:25:42,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:42,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:42,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:25:42,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:42,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438789990] [2019-12-18 13:25:42,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:42,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438789990] [2019-12-18 13:25:42,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:42,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:42,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634311904] [2019-12-18 13:25:42,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:42,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:42,337 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:25:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:42,917 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:25:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:42,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:25:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:42,994 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:25:42,994 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:25:42,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-18 13:25:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:25:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:25:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:25:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:25:43,984 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:25:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:43,985 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:25:43,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:25:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:25:43,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:43,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:43,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:25:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:43,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348787852] [2019-12-18 13:25:43,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:44,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348787852] [2019-12-18 13:25:44,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:44,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:44,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841519865] [2019-12-18 13:25:44,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:44,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:44,061 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:25:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,121 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:25:44,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:25:44,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:25:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:44,140 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:25:44,140 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:25:44,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:25:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:25:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:25:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:25:44,331 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:25:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:44,332 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:25:44,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:25:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:44,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:44,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:44,341 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:25:44,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:44,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017958295] [2019-12-18 13:25:44,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:44,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017958295] [2019-12-18 13:25:44,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:44,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:44,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780569855] [2019-12-18 13:25:44,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:44,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:44,391 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:25:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,481 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:25:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:44,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:44,507 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:25:44,507 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:25:44,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:25:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:25:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:25:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:25:44,742 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:25:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:25:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:25:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:44,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:44,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:44,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:25:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672215450] [2019-12-18 13:25:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:44,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672215450] [2019-12-18 13:25:44,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:44,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:44,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829585909] [2019-12-18 13:25:44,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:44,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:44,797 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:25:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,910 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:25:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:44,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:44,946 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:25:44,946 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:25:44,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:25:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:25:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:25:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:25:45,223 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:25:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:45,223 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:25:45,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:25:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:45,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:45,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] [2019-12-18 13:25:45,235 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:25:45,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:45,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000120125] [2019-12-18 13:25:45,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000120125] [2019-12-18 13:25:45,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:45,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927876106] [2019-12-18 13:25:45,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:45,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:45,345 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:25:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:45,981 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:25:45,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:45,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:25:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:46,022 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:25:46,022 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:25:46,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:25:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:25:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:25:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:25:46,350 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:25:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:46,350 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:25:46,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:25:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:25:46,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:46,363 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-18 13:25:46,363 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:25:46,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:46,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727078221] [2019-12-18 13:25:46,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:46,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727078221] [2019-12-18 13:25:46,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:46,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:46,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491717776] [2019-12-18 13:25:46,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:46,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:46,477 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:25:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:47,079 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:25:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:47,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:25:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:47,118 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:25:47,119 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:25:47,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:25:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:25:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:25:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:25:47,453 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:25:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:47,453 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:25:47,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:25:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:47,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:47,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:47,471 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:25:47,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:47,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687766384] [2019-12-18 13:25:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:47,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687766384] [2019-12-18 13:25:47,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:47,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:47,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444423856] [2019-12-18 13:25:47,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:47,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:47,563 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:25:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:48,845 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:25:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:48,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:25:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:48,902 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:25:48,902 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:25:48,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:25:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:25:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:25:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:25:49,299 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:25:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:49,299 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:25:49,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:25:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:49,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:49,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:49,318 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:25:49,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:49,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32187384] [2019-12-18 13:25:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:49,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32187384] [2019-12-18 13:25:49,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:49,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:49,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908243163] [2019-12-18 13:25:49,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:49,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:49,430 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:25:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:51,203 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:25:51,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:51,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:25:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:51,263 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:25:51,263 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:25:51,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:25:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:25:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:25:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:25:51,881 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:25:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:51,882 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:25:51,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:25:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:51,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:51,898 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-18 13:25:51,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:25:51,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:51,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138990107] [2019-12-18 13:25:51,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:51,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138990107] [2019-12-18 13:25:51,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:51,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:51,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590883332] [2019-12-18 13:25:51,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:51,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:51,977 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:25:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:53,235 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:25:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:53,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:25:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:53,284 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:25:53,284 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:25:53,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:25:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:25:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:25:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:25:53,676 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:25:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:53,677 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:25:53,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:25:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:53,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:53,697 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-18 13:25:53,697 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:25:53,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:53,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213165924] [2019-12-18 13:25:53,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:53,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213165924] [2019-12-18 13:25:53,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:53,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:53,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417297070] [2019-12-18 13:25:53,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:53,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:53,829 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-18 13:25:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:55,131 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 13:25:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:25:55,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:25:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:55,196 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 13:25:55,196 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 13:25:55,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:25:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 13:25:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 13:25:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 13:25:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 13:25:55,774 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 13:25:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:55,774 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 13:25:55,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 13:25:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:55,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:55,789 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-18 13:25:55,789 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:25:55,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:55,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062022074] [2019-12-18 13:25:55,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:55,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062022074] [2019-12-18 13:25:55,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:55,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:55,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498949754] [2019-12-18 13:25:55,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:55,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:55,911 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-18 13:25:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:57,525 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-18 13:25:57,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:57,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:25:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:57,596 INFO L225 Difference]: With dead ends: 39307 [2019-12-18 13:25:57,596 INFO L226 Difference]: Without dead ends: 39307 [2019-12-18 13:25:57,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-18 13:25:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-18 13:25:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 13:25:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-18 13:25:57,969 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-18 13:25:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:57,969 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-18 13:25:57,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-18 13:25:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:25:57,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:57,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:57,989 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:25:57,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:57,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708834564] [2019-12-18 13:25:57,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:58,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708834564] [2019-12-18 13:25:58,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:58,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:25:58,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717028056] [2019-12-18 13:25:58,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:58,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:58,037 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-18 13:25:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:58,105 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-18 13:25:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:58,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:25:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:58,134 INFO L225 Difference]: With dead ends: 16672 [2019-12-18 13:25:58,134 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 13:25:58,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 13:25:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 13:25:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 13:25:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-18 13:25:58,805 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-18 13:25:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:58,806 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-18 13:25:58,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-18 13:25:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:25:58,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:58,832 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-18 13:25:58,833 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:25:58,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:58,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049186009] [2019-12-18 13:25:58,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:58,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049186009] [2019-12-18 13:25:58,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:58,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:58,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320658274] [2019-12-18 13:25:58,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:58,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:58,909 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-18 13:25:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:59,543 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-18 13:25:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:25:59,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:25:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:59,582 INFO L225 Difference]: With dead ends: 27362 [2019-12-18 13:25:59,582 INFO L226 Difference]: Without dead ends: 27362 [2019-12-18 13:25:59,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-18 13:25:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-18 13:25:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-18 13:25:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-18 13:25:59,939 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-18 13:25:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:59,940 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-18 13:25:59,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-18 13:25:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:25:59,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:59,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:59,970 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-18 13:25:59,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:59,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891820581] [2019-12-18 13:25:59,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:00,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891820581] [2019-12-18 13:26:00,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:00,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:00,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661792393] [2019-12-18 13:26:00,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:26:00,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:26:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:00,027 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-18 13:26:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:00,121 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-18 13:26:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:26:00,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:26:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:00,151 INFO L225 Difference]: With dead ends: 20430 [2019-12-18 13:26:00,151 INFO L226 Difference]: Without dead ends: 20430 [2019-12-18 13:26:00,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-18 13:26:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-18 13:26:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-18 13:26:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-18 13:26:00,474 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-18 13:26:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:00,474 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-18 13:26:00,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:26:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-18 13:26:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:00,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:00,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:00,507 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-18 13:26:00,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:00,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912429596] [2019-12-18 13:26:00,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:00,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912429596] [2019-12-18 13:26:00,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:00,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:00,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165426615] [2019-12-18 13:26:00,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:00,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:00,634 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-18 13:26:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:02,238 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-18 13:26:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:02,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 13:26:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:02,325 INFO L225 Difference]: With dead ends: 91773 [2019-12-18 13:26:02,325 INFO L226 Difference]: Without dead ends: 65597 [2019-12-18 13:26:02,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:26:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-18 13:26:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-18 13:26:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-18 13:26:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-18 13:26:02,961 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-18 13:26:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:02,961 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-18 13:26:02,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-18 13:26:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:02,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:02,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:02,986 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-18 13:26:02,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:02,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402160901] [2019-12-18 13:26:02,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:03,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402160901] [2019-12-18 13:26:03,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:03,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:26:03,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502165346] [2019-12-18 13:26:03,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:03,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:03,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:03,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:03,066 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-18 13:26:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:03,581 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-18 13:26:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:26:03,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:26:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:03,645 INFO L225 Difference]: With dead ends: 62216 [2019-12-18 13:26:03,645 INFO L226 Difference]: Without dead ends: 45804 [2019-12-18 13:26:03,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:26:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-18 13:26:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-18 13:26:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-18 13:26:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-18 13:26:04,417 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-18 13:26:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:04,417 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-18 13:26:04,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-18 13:26:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:04,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:04,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:04,445 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-18 13:26:04,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:04,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447552428] [2019-12-18 13:26:04,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447552428] [2019-12-18 13:26:04,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:04,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:04,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257063908] [2019-12-18 13:26:04,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:04,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:04,567 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-18 13:26:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:06,050 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-18 13:26:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:06,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:26:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:06,207 INFO L225 Difference]: With dead ends: 113274 [2019-12-18 13:26:06,207 INFO L226 Difference]: Without dead ends: 108630 [2019-12-18 13:26:06,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:26:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-18 13:26:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-18 13:26:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-18 13:26:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-18 13:26:07,562 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-18 13:26:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:07,562 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-18 13:26:07,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-18 13:26:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:07,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:07,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:07,592 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-18 13:26:07,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:07,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496956564] [2019-12-18 13:26:07,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496956564] [2019-12-18 13:26:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99317357] [2019-12-18 13:26:07,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:07,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:07,692 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-18 13:26:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:09,081 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-18 13:26:09,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:09,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:26:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:09,205 INFO L225 Difference]: With dead ends: 91424 [2019-12-18 13:26:09,205 INFO L226 Difference]: Without dead ends: 87972 [2019-12-18 13:26:09,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:26:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-18 13:26:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-18 13:26:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-18 13:26:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-18 13:26:10,073 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-18 13:26:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:10,073 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-18 13:26:10,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-18 13:26:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:10,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:10,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:10,381 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-18 13:26:10,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:10,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644960561] [2019-12-18 13:26:10,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644960561] [2019-12-18 13:26:10,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:10,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:26:10,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029923958] [2019-12-18 13:26:10,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:10,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:10,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:10,463 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-18 13:26:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:10,892 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-18 13:26:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:26:10,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:26:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:10,958 INFO L225 Difference]: With dead ends: 58989 [2019-12-18 13:26:10,958 INFO L226 Difference]: Without dead ends: 49515 [2019-12-18 13:26:10,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:26:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-18 13:26:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-18 13:26:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-18 13:26:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-18 13:26:11,510 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-18 13:26:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:11,510 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-18 13:26:11,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-18 13:26:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:11,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:11,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:11,539 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-18 13:26:11,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:11,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206267797] [2019-12-18 13:26:11,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:11,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206267797] [2019-12-18 13:26:11,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:11,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:11,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498041413] [2019-12-18 13:26:11,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:11,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:11,637 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-18 13:26:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:13,152 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-18 13:26:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:26:13,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:26:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:13,230 INFO L225 Difference]: With dead ends: 52488 [2019-12-18 13:26:13,230 INFO L226 Difference]: Without dead ends: 52488 [2019-12-18 13:26:13,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:26:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-18 13:26:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-18 13:26:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 13:26:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-18 13:26:14,053 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-18 13:26:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:14,053 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-18 13:26:14,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-18 13:26:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:14,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:14,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:14,086 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-18 13:26:14,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:14,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32015445] [2019-12-18 13:26:14,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:14,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32015445] [2019-12-18 13:26:14,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:14,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:14,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071433659] [2019-12-18 13:26:14,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:14,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:14,231 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-18 13:26:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:16,114 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-18 13:26:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:26:16,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 13:26:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:16,198 INFO L225 Difference]: With dead ends: 56163 [2019-12-18 13:26:16,199 INFO L226 Difference]: Without dead ends: 56163 [2019-12-18 13:26:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:26:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-18 13:26:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-18 13:26:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-18 13:26:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-18 13:26:16,893 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-18 13:26:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-18 13:26:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-18 13:26:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:16,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:16,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:16,925 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-18 13:26:16,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:16,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29041954] [2019-12-18 13:26:16,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:16,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29041954] [2019-12-18 13:26:16,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:16,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:16,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473915017] [2019-12-18 13:26:16,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:16,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:16,990 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-18 13:26:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:17,354 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-18 13:26:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:17,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:26:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:17,438 INFO L225 Difference]: With dead ends: 32830 [2019-12-18 13:26:17,438 INFO L226 Difference]: Without dead ends: 32830 [2019-12-18 13:26:17,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-18 13:26:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-18 13:26:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-18 13:26:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-18 13:26:18,007 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-18 13:26:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:18,008 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-18 13:26:18,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-18 13:26:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:18,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:18,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:18,039 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-18 13:26:18,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:18,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638455539] [2019-12-18 13:26:18,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:18,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638455539] [2019-12-18 13:26:18,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:18,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:18,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378438388] [2019-12-18 13:26:18,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:18,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:18,084 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-18 13:26:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:18,411 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-18 13:26:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:18,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:18,482 INFO L225 Difference]: With dead ends: 36066 [2019-12-18 13:26:18,482 INFO L226 Difference]: Without dead ends: 36066 [2019-12-18 13:26:18,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-18 13:26:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-18 13:26:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-18 13:26:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-18 13:26:19,014 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-18 13:26:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:19,014 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-18 13:26:19,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-18 13:26:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:19,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:19,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:19,043 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-18 13:26:19,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:19,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050762746] [2019-12-18 13:26:19,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:19,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050762746] [2019-12-18 13:26:19,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:19,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:19,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060063167] [2019-12-18 13:26:19,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:19,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:19,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:19,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:19,133 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-18 13:26:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:20,381 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-18 13:26:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:26:20,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:26:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:20,478 INFO L225 Difference]: With dead ends: 80928 [2019-12-18 13:26:20,479 INFO L226 Difference]: Without dead ends: 74194 [2019-12-18 13:26:20,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:26:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-18 13:26:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-18 13:26:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-18 13:26:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-18 13:26:21,228 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-18 13:26:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:21,228 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-18 13:26:21,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-18 13:26:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:21,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:21,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:21,259 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-18 13:26:21,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:21,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789728556] [2019-12-18 13:26:21,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:21,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789728556] [2019-12-18 13:26:21,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:21,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:21,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524908598] [2019-12-18 13:26:21,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:21,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:21,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:21,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:21,314 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-18 13:26:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:21,731 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-18 13:26:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:26:21,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:21,797 INFO L225 Difference]: With dead ends: 45778 [2019-12-18 13:26:21,797 INFO L226 Difference]: Without dead ends: 45778 [2019-12-18 13:26:21,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-18 13:26:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-18 13:26:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-18 13:26:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-18 13:26:22,372 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-18 13:26:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:22,372 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-18 13:26:22,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-18 13:26:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:22,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:22,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:22,675 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-18 13:26:22,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:22,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124959154] [2019-12-18 13:26:22,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:22,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124959154] [2019-12-18 13:26:22,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:22,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:22,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642188051] [2019-12-18 13:26:22,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:22,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:22,792 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-18 13:26:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:24,276 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-18 13:26:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:24,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:26:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:24,417 INFO L225 Difference]: With dead ends: 103839 [2019-12-18 13:26:24,418 INFO L226 Difference]: Without dead ends: 93795 [2019-12-18 13:26:24,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:26:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-18 13:26:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-18 13:26:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-18 13:26:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-18 13:26:25,413 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-18 13:26:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:25,413 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-18 13:26:25,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-18 13:26:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:25,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:25,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:25,450 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-18 13:26:25,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:25,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645725076] [2019-12-18 13:26:25,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:25,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645725076] [2019-12-18 13:26:25,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:25,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:25,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664444297] [2019-12-18 13:26:25,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:25,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:25,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:25,559 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-18 13:26:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:27,055 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-18 13:26:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:26:27,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:26:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:27,180 INFO L225 Difference]: With dead ends: 88943 [2019-12-18 13:26:27,180 INFO L226 Difference]: Without dead ends: 84511 [2019-12-18 13:26:27,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:26:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-18 13:26:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-18 13:26:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-18 13:26:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-18 13:26:28,104 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-18 13:26:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:28,105 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-18 13:26:28,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-18 13:26:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:28,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:28,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:28,138 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-18 13:26:28,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:28,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098039333] [2019-12-18 13:26:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:28,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098039333] [2019-12-18 13:26:28,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:28,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:28,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330308760] [2019-12-18 13:26:28,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:28,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:28,271 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-18 13:26:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:29,832 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-18 13:26:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:26:29,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:26:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:29,910 INFO L225 Difference]: With dead ends: 50821 [2019-12-18 13:26:29,910 INFO L226 Difference]: Without dead ends: 50821 [2019-12-18 13:26:29,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:26:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-18 13:26:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-18 13:26:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-18 13:26:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-18 13:26:30,722 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-18 13:26:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:30,722 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-18 13:26:30,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-18 13:26:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:30,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:30,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:30,755 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-18 13:26:30,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:30,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846796391] [2019-12-18 13:26:30,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:30,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846796391] [2019-12-18 13:26:30,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:30,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:26:30,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691880518] [2019-12-18 13:26:30,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:26:30,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:26:30,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:30,823 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-18 13:26:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:31,378 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-18 13:26:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:26:31,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 13:26:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:31,435 INFO L225 Difference]: With dead ends: 41644 [2019-12-18 13:26:31,435 INFO L226 Difference]: Without dead ends: 41400 [2019-12-18 13:26:31,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:26:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-18 13:26:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-18 13:26:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-18 13:26:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-18 13:26:32,002 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-18 13:26:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-18 13:26:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:26:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-18 13:26:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:32,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:32,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:32,041 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-18 13:26:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:32,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551081182] [2019-12-18 13:26:32,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:32,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551081182] [2019-12-18 13:26:32,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:32,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:26:32,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32864437] [2019-12-18 13:26:32,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:32,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:32,113 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-18 13:26:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:32,287 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-18 13:26:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:32,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:32,336 INFO L225 Difference]: With dead ends: 36756 [2019-12-18 13:26:32,336 INFO L226 Difference]: Without dead ends: 36756 [2019-12-18 13:26:32,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-18 13:26:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-18 13:26:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-18 13:26:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-18 13:26:33,048 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-18 13:26:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:33,048 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-18 13:26:33,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-18 13:26:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:33,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:33,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:33,082 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-18 13:26:33,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:33,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584348383] [2019-12-18 13:26:33,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:33,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584348383] [2019-12-18 13:26:33,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:33,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:26:33,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979174859] [2019-12-18 13:26:33,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:26:33,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:26:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:26:33,284 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 10 states. [2019-12-18 13:26:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:35,303 INFO L93 Difference]: Finished difference Result 53357 states and 158647 transitions. [2019-12-18 13:26:35,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:26:35,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 13:26:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:35,376 INFO L225 Difference]: With dead ends: 53357 [2019-12-18 13:26:35,376 INFO L226 Difference]: Without dead ends: 53357 [2019-12-18 13:26:35,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:26:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53357 states. [2019-12-18 13:26:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53357 to 33311. [2019-12-18 13:26:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33311 states. [2019-12-18 13:26:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33311 states to 33311 states and 100145 transitions. [2019-12-18 13:26:36,019 INFO L78 Accepts]: Start accepts. Automaton has 33311 states and 100145 transitions. Word has length 65 [2019-12-18 13:26:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:36,020 INFO L462 AbstractCegarLoop]: Abstraction has 33311 states and 100145 transitions. [2019-12-18 13:26:36,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:26:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 33311 states and 100145 transitions. [2019-12-18 13:26:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:36,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:36,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:36,054 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-18 13:26:36,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:36,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711885969] [2019-12-18 13:26:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:36,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711885969] [2019-12-18 13:26:36,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:36,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:36,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857835251] [2019-12-18 13:26:36,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:36,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:36,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:36,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:36,115 INFO L87 Difference]: Start difference. First operand 33311 states and 100145 transitions. Second operand 3 states. [2019-12-18 13:26:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:36,220 INFO L93 Difference]: Finished difference Result 33311 states and 100144 transitions. [2019-12-18 13:26:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:36,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:26:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:36,272 INFO L225 Difference]: With dead ends: 33311 [2019-12-18 13:26:36,273 INFO L226 Difference]: Without dead ends: 33311 [2019-12-18 13:26:36,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33311 states. [2019-12-18 13:26:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33311 to 25028. [2019-12-18 13:26:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25028 states. [2019-12-18 13:26:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25028 states to 25028 states and 76920 transitions. [2019-12-18 13:26:36,880 INFO L78 Accepts]: Start accepts. Automaton has 25028 states and 76920 transitions. Word has length 65 [2019-12-18 13:26:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:36,880 INFO L462 AbstractCegarLoop]: Abstraction has 25028 states and 76920 transitions. [2019-12-18 13:26:36,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25028 states and 76920 transitions. [2019-12-18 13:26:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:26:36,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:36,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:36,905 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-18 13:26:36,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:36,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715218346] [2019-12-18 13:26:36,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:36,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715218346] [2019-12-18 13:26:36,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:36,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:36,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947150249] [2019-12-18 13:26:36,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:36,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:36,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:36,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:36,962 INFO L87 Difference]: Start difference. First operand 25028 states and 76920 transitions. Second operand 3 states. [2019-12-18 13:26:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:37,048 INFO L93 Difference]: Finished difference Result 20029 states and 60390 transitions. [2019-12-18 13:26:37,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:26:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:37,082 INFO L225 Difference]: With dead ends: 20029 [2019-12-18 13:26:37,083 INFO L226 Difference]: Without dead ends: 20029 [2019-12-18 13:26:37,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20029 states. [2019-12-18 13:26:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20029 to 18183. [2019-12-18 13:26:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18183 states. [2019-12-18 13:26:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18183 states to 18183 states and 54770 transitions. [2019-12-18 13:26:37,401 INFO L78 Accepts]: Start accepts. Automaton has 18183 states and 54770 transitions. Word has length 66 [2019-12-18 13:26:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:37,402 INFO L462 AbstractCegarLoop]: Abstraction has 18183 states and 54770 transitions. [2019-12-18 13:26:37,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18183 states and 54770 transitions. [2019-12-18 13:26:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:37,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:37,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:37,419 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:26:37,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:37,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749411860] [2019-12-18 13:26:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:37,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:26:37,527 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:26:37,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-18 13:26:37,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd2~0_Out-503489259 ~a$r_buff0_thd2~0_In-503489259) (= ~a$r_buff0_thd1~0_In-503489259 ~a$r_buff1_thd1~0_Out-503489259) (= ~x~0_Out-503489259 1) (= ~a$r_buff1_thd3~0_Out-503489259 ~a$r_buff0_thd3~0_In-503489259) (= ~a$r_buff0_thd1~0_Out-503489259 1) (= ~a$r_buff1_thd0~0_Out-503489259 ~a$r_buff0_thd0~0_In-503489259) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-503489259 0))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-503489259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-503489259, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-503489259, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-503489259, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-503489259} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-503489259, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-503489259, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-503489259, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-503489259, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-503489259, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-503489259, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-503489259, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-503489259, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-503489259, ~x~0=~x~0_Out-503489259} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:26:37,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-18 13:26:37,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-18 13:26:37,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1416305987| |P1Thread1of1ForFork2_#t~ite9_Out-1416305987|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1416305987 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1416305987 256)))) (or (and .cse0 (= ~a~0_In-1416305987 |P1Thread1of1ForFork2_#t~ite9_Out-1416305987|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-1416305987 |P1Thread1of1ForFork2_#t~ite9_Out-1416305987|)))) InVars {~a~0=~a~0_In-1416305987, ~a$w_buff1~0=~a$w_buff1~0_In-1416305987, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1416305987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1416305987} OutVars{~a~0=~a~0_In-1416305987, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1416305987|, ~a$w_buff1~0=~a$w_buff1~0_In-1416305987, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1416305987, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1416305987|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1416305987} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:26:37,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-651141990 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-651141990 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-651141990|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-651141990| ~a$w_buff0_used~0_In-651141990) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-651141990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-651141990} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-651141990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-651141990, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-651141990|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:26:37,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In1579045136 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1579045136 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1579045136 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1579045136 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1579045136 |P1Thread1of1ForFork2_#t~ite12_Out1579045136|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1579045136|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1579045136, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1579045136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1579045136, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1579045136} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1579045136, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1579045136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1579045136, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1579045136|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1579045136} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:26:37,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2141618314 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-2141618314| |P2Thread1of1ForFork0_#t~ite21_Out-2141618314|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2141618314 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-2141618314 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-2141618314 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-2141618314 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out-2141618314| ~a$w_buff0~0_In-2141618314)) (and (not .cse0) (= ~a$w_buff0~0_In-2141618314 |P2Thread1of1ForFork0_#t~ite21_Out-2141618314|) (= |P2Thread1of1ForFork0_#t~ite20_In-2141618314| |P2Thread1of1ForFork0_#t~ite20_Out-2141618314|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-2141618314, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2141618314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2141618314, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2141618314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141618314, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-2141618314|, ~weak$$choice2~0=~weak$$choice2~0_In-2141618314} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-2141618314|, ~a$w_buff0~0=~a$w_buff0~0_In-2141618314, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2141618314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2141618314, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2141618314, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-2141618314|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141618314, ~weak$$choice2~0=~weak$$choice2~0_In-2141618314} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:26:37,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1572689172 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1572689172 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1572689172| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1572689172 |P1Thread1of1ForFork2_#t~ite13_Out-1572689172|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1572689172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1572689172} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1572689172, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1572689172, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1572689172|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:26:37,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-2136422960 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-2136422960 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2136422960 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2136422960 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-2136422960| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-2136422960| ~a$r_buff1_thd2~0_In-2136422960)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2136422960, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2136422960, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2136422960, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2136422960} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2136422960, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2136422960, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2136422960, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2136422960, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2136422960|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:26:37,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:26:37,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1189934932 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1189934932 |P2Thread1of1ForFork0_#t~ite24_Out-1189934932|) (= |P2Thread1of1ForFork0_#t~ite23_In-1189934932| |P2Thread1of1ForFork0_#t~ite23_Out-1189934932|)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1189934932| |P2Thread1of1ForFork0_#t~ite24_Out-1189934932|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1189934932 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1189934932 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1189934932 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1189934932 256)) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1189934932| ~a$w_buff1~0_In-1189934932)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1189934932, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1189934932|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1189934932, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189934932, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1189934932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1189934932, ~weak$$choice2~0=~weak$$choice2~0_In-1189934932} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1189934932, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1189934932|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1189934932|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1189934932, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189934932, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1189934932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1189934932, ~weak$$choice2~0=~weak$$choice2~0_In-1189934932} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:26:37,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1967942191 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1967942191| |P2Thread1of1ForFork0_#t~ite26_Out-1967942191|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1967942191 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1967942191 256)) .cse0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1967942191 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-1967942191 256) 0))) (= |P2Thread1of1ForFork0_#t~ite26_Out-1967942191| ~a$w_buff0_used~0_In-1967942191) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1967942191| |P2Thread1of1ForFork0_#t~ite26_Out-1967942191|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out-1967942191| ~a$w_buff0_used~0_In-1967942191)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1967942191|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1967942191, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1967942191, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1967942191, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967942191, ~weak$$choice2~0=~weak$$choice2~0_In-1967942191} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1967942191|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1967942191|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1967942191, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1967942191, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1967942191, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1967942191, ~weak$$choice2~0=~weak$$choice2~0_In-1967942191} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:26:37,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:26:37,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:26:37,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In929551231 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In929551231 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out929551231| ~a$w_buff1~0_In929551231) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In929551231 |P2Thread1of1ForFork0_#t~ite38_Out929551231|)))) InVars {~a~0=~a~0_In929551231, ~a$w_buff1~0=~a$w_buff1~0_In929551231, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In929551231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In929551231} OutVars{~a~0=~a~0_In929551231, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out929551231|, ~a$w_buff1~0=~a$w_buff1~0_In929551231, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In929551231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In929551231} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:26:37,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:26:37,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In764207991 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In764207991 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out764207991| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out764207991| ~a$w_buff0_used~0_In764207991)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In764207991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In764207991} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out764207991|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In764207991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In764207991} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:26:37,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In694193363 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In694193363 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out694193363| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out694193363| ~a$w_buff0_used~0_In694193363) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In694193363, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In694193363} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out694193363|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In694193363, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In694193363} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:26:37,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-17917689 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-17917689 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-17917689 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-17917689 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-17917689| ~a$w_buff1_used~0_In-17917689) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out-17917689| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-17917689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-17917689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-17917689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-17917689} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-17917689|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-17917689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-17917689, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-17917689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-17917689} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:26:37,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1766808581 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1766808581 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In-1766808581 ~a$r_buff0_thd1~0_Out-1766808581) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1766808581) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1766808581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1766808581} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1766808581|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1766808581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1766808581} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:26:37,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In-1509568253 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1509568253 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1509568253 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1509568253 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1509568253|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1509568253| ~a$r_buff1_thd1~0_In-1509568253) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1509568253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1509568253, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1509568253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1509568253} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1509568253|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1509568253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1509568253, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1509568253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1509568253} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:26:37,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:26:37,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1751017517 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1751017517 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1751017517 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1751017517 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1751017517|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1751017517 |P2Thread1of1ForFork0_#t~ite41_Out1751017517|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1751017517, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1751017517, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1751017517, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1751017517} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1751017517, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1751017517, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1751017517, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1751017517, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1751017517|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:26:37,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1028657814 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1028657814 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1028657814| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1028657814| ~a$r_buff0_thd3~0_In1028657814)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1028657814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1028657814} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1028657814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1028657814, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1028657814|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:26:37,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In1367106453 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1367106453 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1367106453 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1367106453 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In1367106453 |P2Thread1of1ForFork0_#t~ite43_Out1367106453|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1367106453|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1367106453, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1367106453, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1367106453, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1367106453} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1367106453|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1367106453, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1367106453, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1367106453, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1367106453} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:26:37,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:26:37,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:26:37,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In2039642118 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In2039642118 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out2039642118| |ULTIMATE.start_main_#t~ite48_Out2039642118|))) (or (and (not .cse0) (= ~a$w_buff1~0_In2039642118 |ULTIMATE.start_main_#t~ite47_Out2039642118|) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~a~0_In2039642118 |ULTIMATE.start_main_#t~ite47_Out2039642118|) .cse1))) InVars {~a~0=~a~0_In2039642118, ~a$w_buff1~0=~a$w_buff1~0_In2039642118, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2039642118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2039642118} OutVars{~a~0=~a~0_In2039642118, ~a$w_buff1~0=~a$w_buff1~0_In2039642118, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2039642118|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2039642118, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2039642118|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2039642118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:26:37,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In983380373 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In983380373 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out983380373|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out983380373| ~a$w_buff0_used~0_In983380373) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In983380373, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In983380373} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In983380373, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out983380373|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In983380373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:26:37,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-216173352 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-216173352 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-216173352 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-216173352 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-216173352|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-216173352 |ULTIMATE.start_main_#t~ite50_Out-216173352|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-216173352, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-216173352, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-216173352, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-216173352} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-216173352|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-216173352, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-216173352, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-216173352, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-216173352} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:26:37,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-955105016 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-955105016 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-955105016|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-955105016 |ULTIMATE.start_main_#t~ite51_Out-955105016|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-955105016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-955105016} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-955105016|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-955105016, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-955105016} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:26:37,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1993462582 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In1993462582 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1993462582 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1993462582 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1993462582| ~a$r_buff1_thd0~0_In1993462582) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1993462582| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1993462582, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1993462582, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1993462582, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1993462582} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1993462582|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1993462582, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1993462582, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1993462582, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1993462582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:26:37,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:26:37,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:26:37 BasicIcfg [2019-12-18 13:26:37,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:26:37,677 INFO L168 Benchmark]: Toolchain (without parser) took 113550.05 ms. Allocated memory was 146.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,678 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.87 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 157.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,679 INFO L168 Benchmark]: Boogie Preprocessor took 57.42 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,679 INFO L168 Benchmark]: RCFGBuilder took 828.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 101.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,679 INFO L168 Benchmark]: TraceAbstraction took 111814.36 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:37,681 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.56 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.87 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.4 MB in the beginning and 157.0 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.42 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 101.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111814.36 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.4s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9252 SDtfs, 13757 SDslu, 25412 SDs, 0 SdLazy, 16336 SolverSat, 792 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 104 SyntacticMatches, 23 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 39.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 694407 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1781 NumberOfCodeBlocks, 1781 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 313173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...