/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:41:30,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:41:30,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:41:30,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:41:30,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:41:30,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:41:30,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:41:30,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:41:30,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:41:30,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:41:30,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:41:30,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:41:30,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:41:30,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:41:30,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:41:30,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:41:30,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:41:30,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:41:30,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:41:30,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:41:30,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:41:30,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:41:30,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:41:30,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:41:30,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:41:30,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:41:30,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:41:30,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:41:30,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:41:30,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:41:30,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:41:30,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:41:30,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:41:30,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:41:30,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:41:30,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:41:30,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:41:30,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:41:30,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:41:30,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:41:30,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:41:30,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:41:30,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:41:30,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:41:30,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:41:30,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:41:30,872 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:41:30,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:41:30,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:41:30,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:41:30,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:41:30,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:41:30,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:41:30,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:41:30,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:41:30,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:41:30,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:41:30,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:41:30,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:41:30,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:41:30,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:41:30,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:41:30,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:41:30,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:41:30,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:41:30,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:41:30,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:41:30,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:41:30,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:41:30,878 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:41:30,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:41:30,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:41:31,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:41:31,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:41:31,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:41:31,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:41:31,167 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:41:31,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i [2019-12-27 06:41:31,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd13bc724/0e3469bba6224093968f44f5a03625d1/FLAGbaee09c32 [2019-12-27 06:41:31,775 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:41:31,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i [2019-12-27 06:41:31,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd13bc724/0e3469bba6224093968f44f5a03625d1/FLAGbaee09c32 [2019-12-27 06:41:32,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd13bc724/0e3469bba6224093968f44f5a03625d1 [2019-12-27 06:41:32,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:41:32,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:41:32,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:41:32,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:41:32,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:41:32,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32, skipping insertion in model container [2019-12-27 06:41:32,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:41:32,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:41:32,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:41:32,690 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:41:32,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:41:32,828 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:41:32,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32 WrapperNode [2019-12-27 06:41:32,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:41:32,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:41:32,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:41:32,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:41:32,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:41:32,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:41:32,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:41:32,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:41:32,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... [2019-12-27 06:41:32,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:41:32,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:41:32,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:41:32,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:41:32,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:41:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:41:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:41:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:41:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:41:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:41:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:41:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:41:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:41:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:41:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:41:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:41:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:41:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:41:33,029 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:41:33,782 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:41:33,782 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:41:33,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:41:33 BoogieIcfgContainer [2019-12-27 06:41:33,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:41:33,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:41:33,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:41:33,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:41:33,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:41:32" (1/3) ... [2019-12-27 06:41:33,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:41:33, skipping insertion in model container [2019-12-27 06:41:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:41:32" (2/3) ... [2019-12-27 06:41:33,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c93bd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:41:33, skipping insertion in model container [2019-12-27 06:41:33,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:41:33" (3/3) ... [2019-12-27 06:41:33,793 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_power.opt.i [2019-12-27 06:41:33,803 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:41:33,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:41:33,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:41:33,813 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:41:33,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,864 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,865 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,966 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:33,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:41:34,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:41:34,027 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:41:34,027 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:41:34,028 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:41:34,028 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:41:34,028 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:41:34,028 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:41:34,028 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:41:34,028 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:41:34,048 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 06:41:34,050 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 06:41:34,165 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 06:41:34,165 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:41:34,184 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:41:34,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 06:41:34,272 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 06:41:34,272 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:41:34,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:41:34,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:41:34,306 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:41:37,711 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 06:41:37,844 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:41:37,885 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 06:41:37,885 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 06:41:37,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 06:42:00,790 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 06:42:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 06:42:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:42:00,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:00,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:42:00,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:00,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 06:42:00,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:00,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777552815] [2019-12-27 06:42:00,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:01,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777552815] [2019-12-27 06:42:01,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:01,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:42:01,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774639055] [2019-12-27 06:42:01,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:42:01,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:01,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:42:01,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:01,077 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 06:42:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:04,865 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 06:42:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:42:04,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:42:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:05,531 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 06:42:05,533 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 06:42:05,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 06:42:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 06:42:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 06:42:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 06:42:16,057 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 06:42:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:16,058 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 06:42:16,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:42:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 06:42:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:42:16,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:16,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:16,063 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 06:42:16,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:16,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62105473] [2019-12-27 06:42:16,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:16,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62105473] [2019-12-27 06:42:16,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:16,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:42:16,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788924208] [2019-12-27 06:42:16,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:42:16,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:42:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:42:16,170 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 06:42:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:21,927 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 06:42:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:42:21,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:42:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:22,604 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 06:42:22,605 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 06:42:22,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:42:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 06:42:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 06:42:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 06:42:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 06:42:33,195 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 06:42:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:33,196 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 06:42:33,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:42:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 06:42:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:42:33,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:33,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:33,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:33,203 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 06:42:33,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:33,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89814725] [2019-12-27 06:42:33,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:33,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89814725] [2019-12-27 06:42:33,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:33,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:42:33,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819238809] [2019-12-27 06:42:33,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:42:33,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:42:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:33,293 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 06:42:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:33,434 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 06:42:33,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:42:33,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:42:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:33,494 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 06:42:33,494 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 06:42:33,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 06:42:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 06:42:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 06:42:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 06:42:39,375 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 06:42:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:39,376 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 06:42:39,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:42:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 06:42:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:42:39,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:39,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:39,379 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 06:42:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78844448] [2019-12-27 06:42:39,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:39,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78844448] [2019-12-27 06:42:39,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:42:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270698594] [2019-12-27 06:42:39,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:42:39,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:42:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:39,437 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 06:42:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:39,672 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 06:42:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:42:39,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:42:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:39,759 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 06:42:39,759 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 06:42:39,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 06:42:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 06:42:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 06:42:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 06:42:40,534 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 06:42:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:40,535 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 06:42:40,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:42:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 06:42:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:42:40,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:40,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:40,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:40,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:40,539 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 06:42:40,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:40,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384759188] [2019-12-27 06:42:40,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:40,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384759188] [2019-12-27 06:42:40,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:40,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:42:40,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397782867] [2019-12-27 06:42:40,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:42:40,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:40,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:42:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:42:40,616 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 06:42:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:41,461 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 06:42:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:42:41,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:42:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:41,551 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 06:42:41,551 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 06:42:41,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:42:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 06:42:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 06:42:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 06:42:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 06:42:42,390 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 06:42:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:42,391 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 06:42:42,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:42:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 06:42:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:42:42,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:42,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:42,404 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 06:42:42,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:42,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600111721] [2019-12-27 06:42:42,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:42,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600111721] [2019-12-27 06:42:42,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:42,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:42:42,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455360486] [2019-12-27 06:42:42,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:42:42,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:42,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:42:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:42:42,500 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-27 06:42:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:43,514 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 06:42:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:42:43,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:42:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:43,625 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 06:42:43,625 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 06:42:43,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:42:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 06:42:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 06:42:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 06:42:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 06:42:45,031 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 06:42:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:45,032 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 06:42:45,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:42:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 06:42:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:42:45,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:45,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:45,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 06:42:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:45,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247773411] [2019-12-27 06:42:45,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:45,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-27 06:42:45,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247773411] [2019-12-27 06:42:45,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:45,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:42:45,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10521661] [2019-12-27 06:42:45,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:42:45,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:42:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:42:45,115 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-27 06:42:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:45,193 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 06:42:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:42:45,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:42:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:45,220 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 06:42:45,220 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 06:42:45,220 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-27 06:42:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 06:42:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 06:42:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 06:42:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 06:42:45,501 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 06:42:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:45,501 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 06:42:45,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:42:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 06:42:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:42:45,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:45,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:45,515 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 06:42:45,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:45,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389282242] [2019-12-27 06:42:45,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:45,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389282242] [2019-12-27 06:42:45,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:45,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:42:45,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556250228] [2019-12-27 06:42:45,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:42:45,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:45,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:42:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:42:45,621 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 06:42:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:46,274 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 06:42:46,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:42:46,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:42:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:46,312 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 06:42:46,312 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 06:42:46,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:42:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 06:42:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 06:42:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 06:42:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 06:42:46,796 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 06:42:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:46,796 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 06:42:46,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:42:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 06:42:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:42:46,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:46,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:46,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 06:42:46,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:46,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278836534] [2019-12-27 06:42:46,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:46,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278836534] [2019-12-27 06:42:46,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:46,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:42:46,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178750229] [2019-12-27 06:42:46,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:42:46,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:42:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:42:46,914 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-27 06:42:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:48,150 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 06:42:48,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:42:48,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:42:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:48,192 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 06:42:48,193 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 06:42:48,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:42:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 06:42:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 06:42:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 06:42:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 06:42:48,569 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 06:42:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:48,569 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 06:42:48,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:42:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 06:42:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:42:48,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:48,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:48,597 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 06:42:48,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:48,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562745387] [2019-12-27 06:42:48,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562745387] [2019-12-27 06:42:48,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:48,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:42:48,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60781241] [2019-12-27 06:42:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:42:48,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:42:48,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:42:48,685 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-27 06:42:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:49,421 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 06:42:49,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:42:49,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:42:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:49,481 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 06:42:49,481 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 06:42:49,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:42:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 06:42:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 06:42:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 06:42:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 06:42:50,108 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 06:42:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:50,109 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 06:42:50,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:42:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 06:42:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:42:50,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:50,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:50,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 06:42:50,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:50,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281284976] [2019-12-27 06:42:50,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:50,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281284976] [2019-12-27 06:42:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:50,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:42:50,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299020415] [2019-12-27 06:42:50,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:42:50,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:42:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:42:50,220 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-27 06:42:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:50,359 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-27 06:42:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:42:50,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:42:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:50,415 INFO L225 Difference]: With dead ends: 24998 [2019-12-27 06:42:50,416 INFO L226 Difference]: Without dead ends: 24998 [2019-12-27 06:42:50,416 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-27 06:42:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-27 06:42:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-27 06:42:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-27 06:42:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-27 06:42:50,885 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-27 06:42:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:50,885 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-27 06:42:50,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:42:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-27 06:42:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:42:50,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:50,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:50,911 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:50,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-27 06:42:50,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:50,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480973925] [2019-12-27 06:42:50,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:51,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480973925] [2019-12-27 06:42:51,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:51,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:42:51,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641538408] [2019-12-27 06:42:51,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:42:51,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:42:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:42:51,041 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-27 06:42:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:51,557 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-27 06:42:51,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:42:51,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:42:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:51,640 INFO L225 Difference]: With dead ends: 67799 [2019-12-27 06:42:51,640 INFO L226 Difference]: Without dead ends: 51948 [2019-12-27 06:42:51,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:42:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-27 06:42:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-27 06:42:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-27 06:42:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-27 06:42:52,280 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-27 06:42:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:52,280 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-27 06:42:52,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:42:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-27 06:42:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:42:52,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:52,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:52,324 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-27 06:42:52,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:52,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307338972] [2019-12-27 06:42:52,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:52,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307338972] [2019-12-27 06:42:52,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:52,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:42:52,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385289762] [2019-12-27 06:42:52,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:42:52,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:42:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:42:52,424 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-27 06:42:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:53,160 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-27 06:42:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:42:53,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:42:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:53,241 INFO L225 Difference]: With dead ends: 76922 [2019-12-27 06:42:53,242 INFO L226 Difference]: Without dead ends: 54229 [2019-12-27 06:42:53,243 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-27 06:42:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-27 06:42:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-27 06:42:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-27 06:42:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-27 06:42:53,968 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-27 06:42:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:53,969 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-27 06:42:53,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:42:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-27 06:42:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:42:54,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:54,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:54,007 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-27 06:42:54,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:54,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919862773] [2019-12-27 06:42:54,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:54,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919862773] [2019-12-27 06:42:54,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:54,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:42:54,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252455569] [2019-12-27 06:42:54,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:42:54,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:54,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:42:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:42:54,088 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-27 06:42:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:54,658 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-27 06:42:54,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:42:54,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:42:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:54,763 INFO L225 Difference]: With dead ends: 65367 [2019-12-27 06:42:54,763 INFO L226 Difference]: Without dead ends: 58008 [2019-12-27 06:42:54,764 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-27 06:42:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-27 06:42:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-27 06:42:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-27 06:42:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-27 06:42:55,810 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-27 06:42:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:55,811 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-27 06:42:55,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:42:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-27 06:42:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:42:55,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:55,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:55,851 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-27 06:42:55,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:55,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214374527] [2019-12-27 06:42:55,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:55,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214374527] [2019-12-27 06:42:55,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:55,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:42:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009772356] [2019-12-27 06:42:55,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:42:55,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:42:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:55,919 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-27 06:42:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:56,144 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-27 06:42:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:42:56,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:42:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:56,219 INFO L225 Difference]: With dead ends: 39410 [2019-12-27 06:42:56,220 INFO L226 Difference]: Without dead ends: 39410 [2019-12-27 06:42:56,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-27 06:42:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-27 06:42:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-27 06:42:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-27 06:42:56,805 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-27 06:42:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:56,806 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-27 06:42:56,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:42:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-27 06:42:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:42:56,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:56,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:56,849 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-27 06:42:56,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:56,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302575958] [2019-12-27 06:42:56,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302575958] [2019-12-27 06:42:56,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:56,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:42:56,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481682256] [2019-12-27 06:42:56,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:42:56,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:42:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:42:56,901 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-27 06:42:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:57,373 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-27 06:42:57,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:42:57,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:42:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:57,461 INFO L225 Difference]: With dead ends: 53912 [2019-12-27 06:42:57,461 INFO L226 Difference]: Without dead ends: 53912 [2019-12-27 06:42:57,461 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-27 06:42:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-27 06:42:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-27 06:42:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-27 06:42:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-27 06:42:58,494 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-27 06:42:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:58,495 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-27 06:42:58,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:42:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-27 06:42:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:42:58,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:58,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:58,540 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:58,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-27 06:42:58,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:58,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701148936] [2019-12-27 06:42:58,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:58,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701148936] [2019-12-27 06:42:58,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:58,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:42:58,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645110601] [2019-12-27 06:42:58,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:42:58,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:42:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:58,591 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-27 06:42:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:42:59,002 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-27 06:42:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:42:59,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:42:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:42:59,125 INFO L225 Difference]: With dead ends: 53096 [2019-12-27 06:42:59,125 INFO L226 Difference]: Without dead ends: 53096 [2019-12-27 06:42:59,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:42:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-27 06:42:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-27 06:42:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-27 06:42:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-27 06:42:59,870 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-27 06:42:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:42:59,871 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-27 06:42:59,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:42:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-27 06:42:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:42:59,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:42:59,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:42:59,917 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:42:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:42:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-27 06:42:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:42:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214255614] [2019-12-27 06:42:59,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:42:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:42:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:42:59,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214255614] [2019-12-27 06:42:59,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:42:59,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:42:59,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916060859] [2019-12-27 06:42:59,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:42:59,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:42:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:42:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:42:59,971 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-27 06:43:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:00,269 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-27 06:43:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:43:00,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:43:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:00,351 INFO L225 Difference]: With dead ends: 47614 [2019-12-27 06:43:00,351 INFO L226 Difference]: Without dead ends: 47614 [2019-12-27 06:43:00,351 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-27 06:43:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-27 06:43:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-27 06:43:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-27 06:43:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-27 06:43:01,323 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-27 06:43:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:01,323 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-27 06:43:01,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:43:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-27 06:43:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:43:01,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:01,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:01,383 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-27 06:43:01,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:01,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483652941] [2019-12-27 06:43:01,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:01,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483652941] [2019-12-27 06:43:01,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:01,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:43:01,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146161921] [2019-12-27 06:43:01,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:43:01,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:43:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:43:01,481 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-27 06:43:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:02,090 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-27 06:43:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:43:02,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:43:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:02,261 INFO L225 Difference]: With dead ends: 80005 [2019-12-27 06:43:02,262 INFO L226 Difference]: Without dead ends: 73765 [2019-12-27 06:43:02,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:43:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-27 06:43:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-27 06:43:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-27 06:43:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-27 06:43:03,208 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-27 06:43:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:03,208 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-27 06:43:03,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:43:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-27 06:43:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:43:03,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:03,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:03,253 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-27 06:43:03,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:03,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929824790] [2019-12-27 06:43:03,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:03,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929824790] [2019-12-27 06:43:03,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:03,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:43:03,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801215898] [2019-12-27 06:43:03,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:43:03,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:43:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:43:03,350 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 6 states. [2019-12-27 06:43:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:04,248 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-27 06:43:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:43:04,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 06:43:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:04,395 INFO L225 Difference]: With dead ends: 60800 [2019-12-27 06:43:04,395 INFO L226 Difference]: Without dead ends: 60800 [2019-12-27 06:43:04,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-27 06:43:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-27 06:43:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-27 06:43:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-27 06:43:05,491 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-27 06:43:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:05,491 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-27 06:43:05,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:43:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-27 06:43:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:43:05,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:05,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, 1] [2019-12-27 06:43:05,539 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-27 06:43:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:05,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998816505] [2019-12-27 06:43:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:05,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998816505] [2019-12-27 06:43:05,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:05,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:43:05,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047910602] [2019-12-27 06:43:05,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:43:05,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:43:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:43:05,604 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-27 06:43:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:05,857 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-27 06:43:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:43:05,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:43:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:05,929 INFO L225 Difference]: With dead ends: 47014 [2019-12-27 06:43:05,930 INFO L226 Difference]: Without dead ends: 47014 [2019-12-27 06:43:05,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:43:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-27 06:43:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-27 06:43:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-27 06:43:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-27 06:43:06,592 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-27 06:43:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:06,593 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-27 06:43:06,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:43:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-27 06:43:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:43:06,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:06,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:06,647 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-27 06:43:06,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:06,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995037706] [2019-12-27 06:43:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:06,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995037706] [2019-12-27 06:43:06,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:06,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:43:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345256247] [2019-12-27 06:43:06,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:06,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:06,863 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 11 states. [2019-12-27 06:43:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:10,330 INFO L93 Difference]: Finished difference Result 68669 states and 212574 transitions. [2019-12-27 06:43:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 06:43:10,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 06:43:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:10,436 INFO L225 Difference]: With dead ends: 68669 [2019-12-27 06:43:10,436 INFO L226 Difference]: Without dead ends: 68309 [2019-12-27 06:43:10,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 06:43:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68309 states. [2019-12-27 06:43:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68309 to 39224. [2019-12-27 06:43:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39224 states. [2019-12-27 06:43:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39224 states to 39224 states and 124058 transitions. [2019-12-27 06:43:11,335 INFO L78 Accepts]: Start accepts. Automaton has 39224 states and 124058 transitions. Word has length 65 [2019-12-27 06:43:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:11,335 INFO L462 AbstractCegarLoop]: Abstraction has 39224 states and 124058 transitions. [2019-12-27 06:43:11,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39224 states and 124058 transitions. [2019-12-27 06:43:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:43:11,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:11,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:11,382 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1132128568, now seen corresponding path program 2 times [2019-12-27 06:43:11,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:11,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251155407] [2019-12-27 06:43:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:11,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251155407] [2019-12-27 06:43:11,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:11,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:43:11,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435659504] [2019-12-27 06:43:11,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:43:11,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:43:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:43:11,446 INFO L87 Difference]: Start difference. First operand 39224 states and 124058 transitions. Second operand 3 states. [2019-12-27 06:43:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:11,649 INFO L93 Difference]: Finished difference Result 39224 states and 124057 transitions. [2019-12-27 06:43:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:43:11,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:43:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:11,750 INFO L225 Difference]: With dead ends: 39224 [2019-12-27 06:43:11,751 INFO L226 Difference]: Without dead ends: 39224 [2019-12-27 06:43:11,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:43:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39224 states. [2019-12-27 06:43:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39224 to 34165. [2019-12-27 06:43:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34165 states. [2019-12-27 06:43:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 109837 transitions. [2019-12-27 06:43:12,567 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 109837 transitions. Word has length 65 [2019-12-27 06:43:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:12,568 INFO L462 AbstractCegarLoop]: Abstraction has 34165 states and 109837 transitions. [2019-12-27 06:43:12,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:43:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 109837 transitions. [2019-12-27 06:43:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:43:12,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:12,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:12,612 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:12,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 06:43:12,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:12,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312013726] [2019-12-27 06:43:12,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:12,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312013726] [2019-12-27 06:43:12,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:12,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:43:12,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428417952] [2019-12-27 06:43:12,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:43:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:43:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:43:12,830 INFO L87 Difference]: Start difference. First operand 34165 states and 109837 transitions. Second operand 3 states. [2019-12-27 06:43:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:12,957 INFO L93 Difference]: Finished difference Result 26883 states and 84812 transitions. [2019-12-27 06:43:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:43:12,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:43:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:12,995 INFO L225 Difference]: With dead ends: 26883 [2019-12-27 06:43:12,996 INFO L226 Difference]: Without dead ends: 26883 [2019-12-27 06:43:12,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:43:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26883 states. [2019-12-27 06:43:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26883 to 24445. [2019-12-27 06:43:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24445 states. [2019-12-27 06:43:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24445 states to 24445 states and 76956 transitions. [2019-12-27 06:43:13,389 INFO L78 Accepts]: Start accepts. Automaton has 24445 states and 76956 transitions. Word has length 66 [2019-12-27 06:43:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:13,390 INFO L462 AbstractCegarLoop]: Abstraction has 24445 states and 76956 transitions. [2019-12-27 06:43:13,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:43:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 24445 states and 76956 transitions. [2019-12-27 06:43:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:13,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:13,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:13,416 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:13,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 06:43:13,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:13,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720732490] [2019-12-27 06:43:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:13,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720732490] [2019-12-27 06:43:13,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:13,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:43:13,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504726352] [2019-12-27 06:43:13,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:43:13,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:43:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:43:13,572 INFO L87 Difference]: Start difference. First operand 24445 states and 76956 transitions. Second operand 10 states. [2019-12-27 06:43:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:14,877 INFO L93 Difference]: Finished difference Result 35770 states and 112408 transitions. [2019-12-27 06:43:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:43:14,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:43:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:14,920 INFO L225 Difference]: With dead ends: 35770 [2019-12-27 06:43:14,921 INFO L226 Difference]: Without dead ends: 29107 [2019-12-27 06:43:14,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:43:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29107 states. [2019-12-27 06:43:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29107 to 24793. [2019-12-27 06:43:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24793 states. [2019-12-27 06:43:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24793 states to 24793 states and 77927 transitions. [2019-12-27 06:43:15,334 INFO L78 Accepts]: Start accepts. Automaton has 24793 states and 77927 transitions. Word has length 67 [2019-12-27 06:43:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:15,334 INFO L462 AbstractCegarLoop]: Abstraction has 24793 states and 77927 transitions. [2019-12-27 06:43:15,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:43:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 24793 states and 77927 transitions. [2019-12-27 06:43:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:15,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:15,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:15,361 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 06:43:15,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:15,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260445903] [2019-12-27 06:43:15,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:15,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260445903] [2019-12-27 06:43:15,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:43:15,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147843214] [2019-12-27 06:43:15,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:43:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:43:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:43:15,551 INFO L87 Difference]: Start difference. First operand 24793 states and 77927 transitions. Second operand 10 states. [2019-12-27 06:43:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:16,955 INFO L93 Difference]: Finished difference Result 36351 states and 113461 transitions. [2019-12-27 06:43:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:43:16,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:43:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:17,000 INFO L225 Difference]: With dead ends: 36351 [2019-12-27 06:43:17,000 INFO L226 Difference]: Without dead ends: 31235 [2019-12-27 06:43:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:43:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31235 states. [2019-12-27 06:43:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31235 to 25341. [2019-12-27 06:43:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25341 states. [2019-12-27 06:43:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25341 states to 25341 states and 79330 transitions. [2019-12-27 06:43:17,750 INFO L78 Accepts]: Start accepts. Automaton has 25341 states and 79330 transitions. Word has length 67 [2019-12-27 06:43:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:17,751 INFO L462 AbstractCegarLoop]: Abstraction has 25341 states and 79330 transitions. [2019-12-27 06:43:17,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:43:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 25341 states and 79330 transitions. [2019-12-27 06:43:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:17,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:17,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:17,782 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 06:43:17,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:17,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471010650] [2019-12-27 06:43:17,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471010650] [2019-12-27 06:43:17,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:17,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:43:17,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494985778] [2019-12-27 06:43:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:17,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:17,953 INFO L87 Difference]: Start difference. First operand 25341 states and 79330 transitions. Second operand 11 states. [2019-12-27 06:43:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:19,235 INFO L93 Difference]: Finished difference Result 34775 states and 108389 transitions. [2019-12-27 06:43:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:43:19,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:43:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:19,283 INFO L225 Difference]: With dead ends: 34775 [2019-12-27 06:43:19,283 INFO L226 Difference]: Without dead ends: 30764 [2019-12-27 06:43:19,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:43:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30764 states. [2019-12-27 06:43:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30764 to 24977. [2019-12-27 06:43:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24977 states. [2019-12-27 06:43:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24977 states to 24977 states and 78189 transitions. [2019-12-27 06:43:19,730 INFO L78 Accepts]: Start accepts. Automaton has 24977 states and 78189 transitions. Word has length 67 [2019-12-27 06:43:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:19,730 INFO L462 AbstractCegarLoop]: Abstraction has 24977 states and 78189 transitions. [2019-12-27 06:43:19,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24977 states and 78189 transitions. [2019-12-27 06:43:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:19,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:19,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:19,759 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 06:43:19,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:19,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469692690] [2019-12-27 06:43:19,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469692690] [2019-12-27 06:43:19,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:19,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:43:19,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417688404] [2019-12-27 06:43:19,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:19,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:19,933 INFO L87 Difference]: Start difference. First operand 24977 states and 78189 transitions. Second operand 11 states. [2019-12-27 06:43:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:21,452 INFO L93 Difference]: Finished difference Result 35062 states and 109950 transitions. [2019-12-27 06:43:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:43:21,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:43:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:21,502 INFO L225 Difference]: With dead ends: 35062 [2019-12-27 06:43:21,503 INFO L226 Difference]: Without dead ends: 30921 [2019-12-27 06:43:21,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 06:43:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30921 states. [2019-12-27 06:43:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30921 to 25443. [2019-12-27 06:43:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25443 states. [2019-12-27 06:43:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25443 states to 25443 states and 79534 transitions. [2019-12-27 06:43:21,961 INFO L78 Accepts]: Start accepts. Automaton has 25443 states and 79534 transitions. Word has length 67 [2019-12-27 06:43:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:21,962 INFO L462 AbstractCegarLoop]: Abstraction has 25443 states and 79534 transitions. [2019-12-27 06:43:21,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25443 states and 79534 transitions. [2019-12-27 06:43:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:21,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:21,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:21,990 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1968134607, now seen corresponding path program 5 times [2019-12-27 06:43:21,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:21,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314131476] [2019-12-27 06:43:21,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:22,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314131476] [2019-12-27 06:43:22,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:22,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 06:43:22,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575903164] [2019-12-27 06:43:22,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 06:43:22,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:22,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 06:43:22,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:43:22,565 INFO L87 Difference]: Start difference. First operand 25443 states and 79534 transitions. Second operand 18 states. [2019-12-27 06:43:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:25,507 INFO L93 Difference]: Finished difference Result 29552 states and 91557 transitions. [2019-12-27 06:43:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:43:25,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 06:43:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:25,549 INFO L225 Difference]: With dead ends: 29552 [2019-12-27 06:43:25,549 INFO L226 Difference]: Without dead ends: 27921 [2019-12-27 06:43:25,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 06:43:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27921 states. [2019-12-27 06:43:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27921 to 25716. [2019-12-27 06:43:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25716 states. [2019-12-27 06:43:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25716 states to 25716 states and 80382 transitions. [2019-12-27 06:43:25,963 INFO L78 Accepts]: Start accepts. Automaton has 25716 states and 80382 transitions. Word has length 67 [2019-12-27 06:43:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:25,964 INFO L462 AbstractCegarLoop]: Abstraction has 25716 states and 80382 transitions. [2019-12-27 06:43:25,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 06:43:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 25716 states and 80382 transitions. [2019-12-27 06:43:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:25,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:25,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:25,996 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-27 06:43:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1568553899, now seen corresponding path program 6 times [2019-12-27 06:43:25,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:25,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187587307] [2019-12-27 06:43:25,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:26,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187587307] [2019-12-27 06:43:26,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:43:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334314409] [2019-12-27 06:43:26,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:26,148 INFO L87 Difference]: Start difference. First operand 25716 states and 80382 transitions. Second operand 11 states. [2019-12-27 06:43:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:27,602 INFO L93 Difference]: Finished difference Result 33928 states and 105662 transitions. [2019-12-27 06:43:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:43:27,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:43:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:27,650 INFO L225 Difference]: With dead ends: 33928 [2019-12-27 06:43:27,650 INFO L226 Difference]: Without dead ends: 32396 [2019-12-27 06:43:27,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:43:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32396 states. [2019-12-27 06:43:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32396 to 25343. [2019-12-27 06:43:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25343 states. [2019-12-27 06:43:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25343 states to 25343 states and 79208 transitions. [2019-12-27 06:43:28,101 INFO L78 Accepts]: Start accepts. Automaton has 25343 states and 79208 transitions. Word has length 67 [2019-12-27 06:43:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:28,102 INFO L462 AbstractCegarLoop]: Abstraction has 25343 states and 79208 transitions. [2019-12-27 06:43:28,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25343 states and 79208 transitions. [2019-12-27 06:43:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:28,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:28,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:28,131 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-27 06:43:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1913997353, now seen corresponding path program 7 times [2019-12-27 06:43:28,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:28,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68074782] [2019-12-27 06:43:28,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:28,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68074782] [2019-12-27 06:43:28,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:28,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:43:28,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044409385] [2019-12-27 06:43:28,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:28,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:28,334 INFO L87 Difference]: Start difference. First operand 25343 states and 79208 transitions. Second operand 11 states. [2019-12-27 06:43:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:29,514 INFO L93 Difference]: Finished difference Result 51369 states and 160889 transitions. [2019-12-27 06:43:29,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:43:29,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:43:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:29,593 INFO L225 Difference]: With dead ends: 51369 [2019-12-27 06:43:29,593 INFO L226 Difference]: Without dead ends: 48839 [2019-12-27 06:43:29,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:43:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48839 states. [2019-12-27 06:43:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48839 to 28717. [2019-12-27 06:43:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28717 states. [2019-12-27 06:43:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 89873 transitions. [2019-12-27 06:43:30,418 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 89873 transitions. Word has length 67 [2019-12-27 06:43:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:30,418 INFO L462 AbstractCegarLoop]: Abstraction has 28717 states and 89873 transitions. [2019-12-27 06:43:30,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 89873 transitions. [2019-12-27 06:43:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:30,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:30,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:30,452 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-27 06:43:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1272640249, now seen corresponding path program 8 times [2019-12-27 06:43:30,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:30,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719515306] [2019-12-27 06:43:30,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:30,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-27 06:43:30,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719515306] [2019-12-27 06:43:30,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:30,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:43:30,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365904955] [2019-12-27 06:43:30,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:43:30,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:43:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:43:30,632 INFO L87 Difference]: Start difference. First operand 28717 states and 89873 transitions. Second operand 11 states. [2019-12-27 06:43:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:31,752 INFO L93 Difference]: Finished difference Result 49397 states and 154091 transitions. [2019-12-27 06:43:31,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:43:31,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:43:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:31,821 INFO L225 Difference]: With dead ends: 49397 [2019-12-27 06:43:31,821 INFO L226 Difference]: Without dead ends: 40641 [2019-12-27 06:43:31,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:43:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40641 states. [2019-12-27 06:43:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40641 to 23551. [2019-12-27 06:43:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23551 states. [2019-12-27 06:43:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23551 states to 23551 states and 73524 transitions. [2019-12-27 06:43:32,325 INFO L78 Accepts]: Start accepts. Automaton has 23551 states and 73524 transitions. Word has length 67 [2019-12-27 06:43:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:32,325 INFO L462 AbstractCegarLoop]: Abstraction has 23551 states and 73524 transitions. [2019-12-27 06:43:32,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:43:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23551 states and 73524 transitions. [2019-12-27 06:43:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:32,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:32,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:43:32,350 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-27 06:43:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 9 times [2019-12-27 06:43:32,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:32,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917720738] [2019-12-27 06:43:32,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:43:32,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917720738] [2019-12-27 06:43:32,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:32,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:43:32,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959259906] [2019-12-27 06:43:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:43:32,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:43:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:43:32,506 INFO L87 Difference]: Start difference. First operand 23551 states and 73524 transitions. Second operand 12 states. [2019-12-27 06:43:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:33,500 INFO L93 Difference]: Finished difference Result 40683 states and 126906 transitions. [2019-12-27 06:43:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:43:33,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:43:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:33,557 INFO L225 Difference]: With dead ends: 40683 [2019-12-27 06:43:33,558 INFO L226 Difference]: Without dead ends: 40440 [2019-12-27 06:43:33,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:43:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40440 states. [2019-12-27 06:43:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40440 to 23375. [2019-12-27 06:43:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23375 states. [2019-12-27 06:43:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23375 states to 23375 states and 73052 transitions. [2019-12-27 06:43:34,055 INFO L78 Accepts]: Start accepts. Automaton has 23375 states and 73052 transitions. Word has length 67 [2019-12-27 06:43:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:43:34,055 INFO L462 AbstractCegarLoop]: Abstraction has 23375 states and 73052 transitions. [2019-12-27 06:43:34,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:43:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23375 states and 73052 transitions. [2019-12-27 06:43:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:43:34,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:34,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, 1, 1] [2019-12-27 06:43:34,081 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-27 06:43:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 10 times [2019-12-27 06:43:34,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:34,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728391423] [2019-12-27 06:43:34,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:43:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:43:34,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:43:34,191 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:43:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1300~0.base_21| 1)) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1300~0.base_21|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1300~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1300~0.base_21|) |v_ULTIMATE.start_main_~#t1300~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1300~0.base_21|)) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1300~0.base_21| 4) |v_#length_21|) (= 0 |v_ULTIMATE.start_main_~#t1300~0.offset_16|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t1301~0.offset=|v_ULTIMATE.start_main_~#t1301~0.offset_13|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1302~0.base=|v_ULTIMATE.start_main_~#t1302~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ULTIMATE.start_main_~#t1301~0.base=|v_ULTIMATE.start_main_~#t1301~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1300~0.base=|v_ULTIMATE.start_main_~#t1300~0.base_21|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1300~0.offset=|v_ULTIMATE.start_main_~#t1300~0.offset_16|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1302~0.offset=|v_ULTIMATE.start_main_~#t1302~0.offset_15|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1301~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1302~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1301~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1300~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1300~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1302~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:43:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1301~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1301~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1301~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1301~0.base_11|) |v_ULTIMATE.start_main_~#t1301~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1301~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1301~0.base_11|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1301~0.base_11| 1) |v_#valid_38|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1301~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1301~0.offset=|v_ULTIMATE.start_main_~#t1301~0.offset_9|, ULTIMATE.start_main_~#t1301~0.base=|v_ULTIMATE.start_main_~#t1301~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1301~0.offset, ULTIMATE.start_main_~#t1301~0.base, #length] because there is no mapped edge [2019-12-27 06:43:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:43:34,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1504945856 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1504945856 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1504945856| ~z$w_buff1~0_In-1504945856) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1504945856| ~z~0_In-1504945856) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, ~z$w_buff1~0=~z$w_buff1~0_In-1504945856, ~z~0=~z~0_In-1504945856} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1504945856|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, ~z$w_buff1~0=~z$w_buff1~0_In-1504945856, ~z~0=~z~0_In-1504945856} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:43:34,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 06:43:34,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1302~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1302~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1302~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1302~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1302~0.base_13| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1302~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1302~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1302~0.base_13|) |v_ULTIMATE.start_main_~#t1302~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1302~0.offset=|v_ULTIMATE.start_main_~#t1302~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1302~0.base=|v_ULTIMATE.start_main_~#t1302~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1302~0.offset, #length, ULTIMATE.start_main_~#t1302~0.base] because there is no mapped edge [2019-12-27 06:43:34,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In15692218 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In15692218 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In15692218 |P1Thread1of1ForFork2_#t~ite11_Out15692218|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out15692218|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In15692218} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out15692218|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In15692218} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:43:34,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-820666533 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-820666533 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-820666533 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-820666533 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-820666533 |P1Thread1of1ForFork2_#t~ite12_Out-820666533|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-820666533|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-820666533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-820666533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-820666533, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-820666533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-820666533, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-820666533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-820666533, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-820666533|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-820666533} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:43:34,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In447338207 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In447338207 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out447338207| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out447338207| ~z$r_buff0_thd2~0_In447338207) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In447338207, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447338207} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In447338207, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out447338207|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447338207} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:43:34,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1379770585 256)))) (or (and .cse0 (= ~z$w_buff0_used~0_In-1379770585 |P2Thread1of1ForFork0_#t~ite26_Out-1379770585|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1379770585 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1379770585 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1379770585 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1379770585 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1379770585| |P2Thread1of1ForFork0_#t~ite26_Out-1379770585|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1379770585| ~z$w_buff0_used~0_In-1379770585) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1379770585| |P2Thread1of1ForFork0_#t~ite26_Out-1379770585|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1379770585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1379770585, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1379770585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1379770585, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1379770585, ~weak$$choice2~0=~weak$$choice2~0_In-1379770585} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1379770585|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1379770585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1379770585, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1379770585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1379770585, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1379770585, ~weak$$choice2~0=~weak$$choice2~0_In-1379770585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:43:34,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:43:34,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1081346379 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1081346379 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1081346379| 0)) (and (= ~z$w_buff0_used~0_In1081346379 |P0Thread1of1ForFork1_#t~ite5_Out1081346379|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1081346379, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1081346379} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1081346379|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1081346379, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1081346379} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:43:34,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:43:34,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-84258984 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-84258984 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-84258984| |P2Thread1of1ForFork0_#t~ite39_Out-84258984|))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-84258984| ~z$w_buff1~0_In-84258984) (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-84258984| ~z~0_In-84258984) (or .cse1 .cse2) .cse0))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-84258984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-84258984, ~z$w_buff1~0=~z$w_buff1~0_In-84258984, ~z~0=~z~0_In-84258984} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-84258984|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-84258984|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-84258984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-84258984, ~z$w_buff1~0=~z$w_buff1~0_In-84258984, ~z~0=~z~0_In-84258984} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:43:34,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2114994833 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2114994833 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2114994833 |P2Thread1of1ForFork0_#t~ite40_Out2114994833|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out2114994833|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2114994833, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2114994833} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2114994833, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2114994833|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2114994833} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:43:34,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-419523137 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-419523137 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-419523137 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-419523137 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-419523137| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-419523137| ~z$w_buff1_used~0_In-419523137)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-419523137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419523137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-419523137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-419523137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419523137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-419523137, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-419523137|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:43:34,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In398753876 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In398753876 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out398753876|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out398753876| ~z$r_buff0_thd3~0_In398753876) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398753876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In398753876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In398753876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In398753876, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out398753876|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:43:34,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1974860953 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1974860953 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1974860953 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1974860953 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1974860953 |P2Thread1of1ForFork0_#t~ite43_Out-1974860953|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1974860953|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1974860953, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1974860953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1974860953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1974860953} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1974860953|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1974860953, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1974860953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1974860953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1974860953} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:43:34,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:43:34,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-545055444 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-545055444 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-545055444 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-545055444 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-545055444|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-545055444 |P0Thread1of1ForFork1_#t~ite6_Out-545055444|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-545055444, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545055444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545055444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545055444} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-545055444, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-545055444|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545055444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545055444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545055444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:43:34,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In858567227 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In858567227 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out858567227)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In858567227 ~z$r_buff0_thd1~0_Out858567227)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In858567227, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In858567227} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In858567227, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out858567227|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out858567227} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:43:34,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1047831524 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1047831524 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1047831524 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1047831524 256)))) (or (and (= ~z$r_buff1_thd1~0_In-1047831524 |P0Thread1of1ForFork1_#t~ite8_Out-1047831524|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1047831524|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047831524, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1047831524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1047831524, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1047831524} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1047831524|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1047831524, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1047831524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1047831524, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1047831524} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:43:34,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:43:34,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1757553567 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1757553567 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1757553567 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1757553567 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1757553567|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1757553567 |P1Thread1of1ForFork2_#t~ite14_Out-1757553567|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1757553567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1757553567, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1757553567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1757553567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1757553567, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1757553567|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1757553567} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:43:34,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:43:34,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:43:34,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-497893200 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-497893200| |ULTIMATE.start_main_#t~ite48_Out-497893200|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-497893200 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-497893200| ~z~0_In-497893200) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out-497893200| ~z$w_buff1~0_In-497893200) (not .cse1) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-497893200, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-497893200, ~z$w_buff1~0=~z$w_buff1~0_In-497893200, ~z~0=~z~0_In-497893200} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-497893200, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-497893200|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-497893200, ~z$w_buff1~0=~z$w_buff1~0_In-497893200, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-497893200|, ~z~0=~z~0_In-497893200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:43:34,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1699504903 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1699504903 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1699504903| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1699504903| ~z$w_buff0_used~0_In-1699504903) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1699504903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1699504903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1699504903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:43:34,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2095361101 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2095361101 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2095361101 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2095361101 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2095361101 |ULTIMATE.start_main_#t~ite50_Out2095361101|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out2095361101|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095361101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2095361101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095361101} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2095361101|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095361101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2095361101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095361101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:43:34,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1244534672 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1244534672 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1244534672| ~z$r_buff0_thd0~0_In-1244534672)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1244534672| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1244534672, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1244534672} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1244534672, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1244534672|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1244534672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:43:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1165329021 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1165329021 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1165329021 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1165329021 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1165329021| ~z$r_buff1_thd0~0_In-1165329021) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out-1165329021| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165329021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165329021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165329021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165329021} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1165329021|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165329021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165329021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165329021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165329021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:43:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:43:34,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:43:34 BasicIcfg [2019-12-27 06:43:34,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:43:34,305 INFO L168 Benchmark]: Toolchain (without parser) took 122210.60 ms. Allocated memory was 146.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.8 MB in the beginning and 900.6 MB in the end (delta: -799.8 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,305 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.65 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,307 INFO L168 Benchmark]: Boogie Preprocessor took 37.95 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,307 INFO L168 Benchmark]: RCFGBuilder took 844.45 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 102.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,307 INFO L168 Benchmark]: TraceAbstraction took 120518.31 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.7 MB in the beginning and 900.6 MB in the end (delta: -798.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:43:34,310 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.47 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.65 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.95 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.45 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 102.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120518.31 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.7 MB in the beginning and 900.6 MB in the end (delta: -798.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1300, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1301, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1302, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 120.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8271 SDtfs, 10190 SDslu, 33666 SDs, 0 SdLazy, 19388 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 74 SyntacticMatches, 22 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 47.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 381405 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1656 ConstructedInterpolants, 0 QuantifiedInterpolants, 370052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...