/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:33:15,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:33:15,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:33:15,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:33:15,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:33:15,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:33:15,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:33:15,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:33:15,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:33:15,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:33:15,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:33:15,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:33:15,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:33:15,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:33:15,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:33:15,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:33:15,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:33:15,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:33:15,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:33:15,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:33:15,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:33:15,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:33:15,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:33:15,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:33:15,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:33:15,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:33:15,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:33:15,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:33:15,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:33:15,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:33:15,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:33:15,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:33:15,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:33:15,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:33:15,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:33:15,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:33:15,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:33:15,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:33:15,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:33:15,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:33:15,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:33:15,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:33:15,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:33:15,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:33:15,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:33:15,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:33:15,920 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:33:15,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:33:15,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:33:15,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:33:15,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:33:15,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:33:15,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:33:15,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:33:15,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:33:15,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:33:15,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:33:15,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:33:15,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:33:15,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:33:15,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:33:15,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:33:15,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:33:15,927 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:33:15,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:33:15,927 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:33:15,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:33:16,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:33:16,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:33:16,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:33:16,230 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:33:16,231 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:33:16,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-27 16:33:16,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0e671ea/4697079ab7cd4e52a06338115fdfbf67/FLAGa2cc06179 [2019-12-27 16:33:16,822 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:33:16,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2019-12-27 16:33:16,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0e671ea/4697079ab7cd4e52a06338115fdfbf67/FLAGa2cc06179 [2019-12-27 16:33:17,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce0e671ea/4697079ab7cd4e52a06338115fdfbf67 [2019-12-27 16:33:17,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:33:17,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:33:17,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:33:17,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:33:17,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:33:17,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:17,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad5612a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17, skipping insertion in model container [2019-12-27 16:33:17,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:17,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:33:17,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:33:17,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:33:17,673 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:33:17,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:33:17,901 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:33:17,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17 WrapperNode [2019-12-27 16:33:17,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:33:17,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:33:17,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:33:17,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:33:17,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:17,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:17,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:33:17,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:33:17,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:33:17,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:33:17,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:17,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... [2019-12-27 16:33:18,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:33:18,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:33:18,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:33:18,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:33:18,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:33:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:33:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:33:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:33:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:33:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:33:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:33:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:33:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:33:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:33:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:33:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:33:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:33:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:33:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:33:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:33:18,150 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:33:18,906 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:33:18,907 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:33:18,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:33:18 BoogieIcfgContainer [2019-12-27 16:33:18,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:33:18,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:33:18,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:33:18,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:33:18,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:33:17" (1/3) ... [2019-12-27 16:33:18,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e0b072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:33:18, skipping insertion in model container [2019-12-27 16:33:18,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:17" (2/3) ... [2019-12-27 16:33:18,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e0b072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:33:18, skipping insertion in model container [2019-12-27 16:33:18,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:33:18" (3/3) ... [2019-12-27 16:33:18,918 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2019-12-27 16:33:18,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:33:18,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:33:18,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:33:18,941 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:33:19,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,024 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,024 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,057 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,065 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,066 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,071 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,072 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,072 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,072 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,072 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,072 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,075 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,076 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,077 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,081 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,082 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,097 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,099 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:33:19,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:33:19,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:33:19,150 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:33:19,150 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:33:19,150 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:33:19,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:33:19,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:33:19,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:33:19,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:33:19,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 16:33:19,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:33:19,285 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:33:19,285 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:33:19,302 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:33:19,330 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 16:33:19,394 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 16:33:19,394 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:33:19,403 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:33:19,424 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:33:19,426 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:33:24,684 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:33:24,802 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 16:33:25,257 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 16:33:25,404 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 16:33:25,448 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-27 16:33:25,448 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 16:33:25,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 16:34:06,866 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-27 16:34:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-27 16:34:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:34:06,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:06,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:06,877 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-27 16:34:06,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:06,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527683644] [2019-12-27 16:34:06,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:34:07,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527683644] [2019-12-27 16:34:07,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:07,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:34:07,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1846820922] [2019-12-27 16:34:07,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:07,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:07,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:34:07,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:07,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:34:07,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:34:07,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:34:07,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:07,229 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-27 16:34:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:10,658 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-27 16:34:10,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:34:10,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:34:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:16,687 INFO L225 Difference]: With dead ends: 169554 [2019-12-27 16:34:16,688 INFO L226 Difference]: Without dead ends: 159076 [2019-12-27 16:34:16,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:34:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-27 16:34:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-27 16:34:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-27 16:34:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-27 16:34:35,925 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-27 16:34:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:34:35,926 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-27 16:34:35,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:34:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-27 16:34:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:34:35,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:34:35,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:34:35,942 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:34:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:34:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-27 16:34:35,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:34:35,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57728797] [2019-12-27 16:34:35,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:34:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:34:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:34:36,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57728797] [2019-12-27 16:34:36,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:34:36,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:34:36,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962437189] [2019-12-27 16:34:36,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:34:36,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:34:36,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:34:36,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:34:36,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:34:36,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:34:36,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:34:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:34:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:34:36,104 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-27 16:34:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:34:44,548 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-27 16:34:44,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:34:44,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:34:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:34:46,237 INFO L225 Difference]: With dead ends: 251868 [2019-12-27 16:34:46,238 INFO L226 Difference]: Without dead ends: 251658 [2019-12-27 16:34:46,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:34:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-27 16:35:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-27 16:35:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-27 16:35:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-27 16:35:13,808 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-27 16:35:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:13,808 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-27 16:35:13,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:35:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-27 16:35:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:35:13,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:13,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:13,813 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-27 16:35:13,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:13,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140297638] [2019-12-27 16:35:13,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:13,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140297638] [2019-12-27 16:35:13,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:13,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:35:13,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168542907] [2019-12-27 16:35:13,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:13,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:13,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:35:13,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:13,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:35:13,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:35:13,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:35:13,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:35:13,882 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-27 16:35:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:14,619 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-27 16:35:14,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:35:14,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:35:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:15,274 INFO L225 Difference]: With dead ends: 146539 [2019-12-27 16:35:15,276 INFO L226 Difference]: Without dead ends: 146539 [2019-12-27 16:35:15,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:35:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-27 16:35:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-27 16:35:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-27 16:35:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-27 16:35:33,542 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-27 16:35:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:33,542 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-27 16:35:33,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:35:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-27 16:35:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:35:33,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:33,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:33,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-27 16:35:33,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:33,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207342667] [2019-12-27 16:35:33,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:33,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 16:35:33,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207342667] [2019-12-27 16:35:33,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:33,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:35:33,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978052406] [2019-12-27 16:35:33,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:33,633 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:33,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:35:33,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:33,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:35:33,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:35:33,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:35:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:35:33,679 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 5 states. [2019-12-27 16:35:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:33,938 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-27 16:35:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:35:33,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:35:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:34,054 INFO L225 Difference]: With dead ends: 40251 [2019-12-27 16:35:34,054 INFO L226 Difference]: Without dead ends: 40251 [2019-12-27 16:35:34,055 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 16:35:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-27 16:35:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-27 16:35:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-27 16:35:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-27 16:35:40,267 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-27 16:35:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-27 16:35:40,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:35:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-27 16:35:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:35:40,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:40,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:40,270 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-27 16:35:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:40,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895808487] [2019-12-27 16:35:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:40,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895808487] [2019-12-27 16:35:40,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:40,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:35:40,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019523230] [2019-12-27 16:35:40,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:40,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:40,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:35:40,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:40,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:35:40,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:35:40,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:35:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:35:40,496 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 7 states. [2019-12-27 16:35:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:41,268 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-27 16:35:41,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:35:41,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 16:35:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:41,436 INFO L225 Difference]: With dead ends: 58215 [2019-12-27 16:35:41,436 INFO L226 Difference]: Without dead ends: 58197 [2019-12-27 16:35:41,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:35:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-27 16:35:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-27 16:35:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-27 16:35:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-27 16:35:42,773 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-27 16:35:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:42,774 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-27 16:35:42,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:35:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-27 16:35:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:35:42,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:42,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:42,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-27 16:35:42,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:42,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945519484] [2019-12-27 16:35:42,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:42,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945519484] [2019-12-27 16:35:42,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:42,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:35:42,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [887254366] [2019-12-27 16:35:42,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:42,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:42,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 100 transitions. [2019-12-27 16:35:42,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:43,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:35:43,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:35:43,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:43,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:35:43,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:35:43,059 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 8 states. [2019-12-27 16:35:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:44,868 INFO L93 Difference]: Finished difference Result 142716 states and 495019 transitions. [2019-12-27 16:35:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:35:44,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 16:35:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:45,185 INFO L225 Difference]: With dead ends: 142716 [2019-12-27 16:35:45,185 INFO L226 Difference]: Without dead ends: 142663 [2019-12-27 16:35:45,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:35:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142663 states. [2019-12-27 16:35:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142663 to 69309. [2019-12-27 16:35:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69309 states. [2019-12-27 16:35:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69309 states to 69309 states and 246052 transitions. [2019-12-27 16:35:48,102 INFO L78 Accepts]: Start accepts. Automaton has 69309 states and 246052 transitions. Word has length 24 [2019-12-27 16:35:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:48,102 INFO L462 AbstractCegarLoop]: Abstraction has 69309 states and 246052 transitions. [2019-12-27 16:35:48,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:35:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69309 states and 246052 transitions. [2019-12-27 16:35:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:35:48,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:48,126 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] [2019-12-27 16:35:48,126 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 536202934, now seen corresponding path program 2 times [2019-12-27 16:35:48,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:48,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796317102] [2019-12-27 16:35:48,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796317102] [2019-12-27 16:35:48,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:48,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:35:48,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562635432] [2019-12-27 16:35:48,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:48,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:48,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 40 transitions. [2019-12-27 16:35:48,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:48,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:35:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:35:48,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:35:48,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:35:48,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:48,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:35:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:35:48,355 INFO L87 Difference]: Start difference. First operand 69309 states and 246052 transitions. Second operand 10 states. [2019-12-27 16:35:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:50,804 INFO L93 Difference]: Finished difference Result 125885 states and 435178 transitions. [2019-12-27 16:35:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:35:50,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 16:35:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:51,079 INFO L225 Difference]: With dead ends: 125885 [2019-12-27 16:35:51,079 INFO L226 Difference]: Without dead ends: 125851 [2019-12-27 16:35:51,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:35:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125851 states. [2019-12-27 16:35:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125851 to 67417. [2019-12-27 16:35:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67417 states. [2019-12-27 16:35:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67417 states to 67417 states and 240626 transitions. [2019-12-27 16:35:56,337 INFO L78 Accepts]: Start accepts. Automaton has 67417 states and 240626 transitions. Word has length 24 [2019-12-27 16:35:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:56,338 INFO L462 AbstractCegarLoop]: Abstraction has 67417 states and 240626 transitions. [2019-12-27 16:35:56,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:35:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 67417 states and 240626 transitions. [2019-12-27 16:35:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:35:56,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:56,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:35:56,796 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:56,797 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-27 16:35:56,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:56,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409377207] [2019-12-27 16:35:56,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:56,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409377207] [2019-12-27 16:35:56,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:56,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:35:56,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330783839] [2019-12-27 16:35:56,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:56,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:56,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:35:56,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:56,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:35:56,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:35:56,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:35:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:35:56,901 INFO L87 Difference]: Start difference. First operand 67417 states and 240626 transitions. Second operand 6 states. [2019-12-27 16:35:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:57,172 INFO L93 Difference]: Finished difference Result 38410 states and 139394 transitions. [2019-12-27 16:35:57,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:35:57,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:35:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:57,285 INFO L225 Difference]: With dead ends: 38410 [2019-12-27 16:35:57,286 INFO L226 Difference]: Without dead ends: 38410 [2019-12-27 16:35:57,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:35:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38410 states. [2019-12-27 16:35:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38410 to 37132. [2019-12-27 16:35:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37132 states. [2019-12-27 16:35:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37132 states to 37132 states and 134841 transitions. [2019-12-27 16:35:57,983 INFO L78 Accepts]: Start accepts. Automaton has 37132 states and 134841 transitions. Word has length 28 [2019-12-27 16:35:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:57,984 INFO L462 AbstractCegarLoop]: Abstraction has 37132 states and 134841 transitions. [2019-12-27 16:35:57,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:35:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37132 states and 134841 transitions. [2019-12-27 16:35:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:35:58,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:58,050 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] [2019-12-27 16:35:58,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash -704987358, now seen corresponding path program 1 times [2019-12-27 16:35:58,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:58,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455874446] [2019-12-27 16:35:58,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:35:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:35:58,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455874446] [2019-12-27 16:35:58,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:35:58,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:35:58,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586718320] [2019-12-27 16:35:58,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:35:58,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:35:58,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 160 transitions. [2019-12-27 16:35:58,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:35:58,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:35:58,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:35:58,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:35:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:35:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:35:58,218 INFO L87 Difference]: Start difference. First operand 37132 states and 134841 transitions. Second operand 5 states. [2019-12-27 16:35:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:35:59,130 INFO L93 Difference]: Finished difference Result 53870 states and 186929 transitions. [2019-12-27 16:35:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:35:59,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 16:35:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:35:59,228 INFO L225 Difference]: With dead ends: 53870 [2019-12-27 16:35:59,228 INFO L226 Difference]: Without dead ends: 37644 [2019-12-27 16:35:59,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:35:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37644 states. [2019-12-27 16:35:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37644 to 37366. [2019-12-27 16:35:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37366 states. [2019-12-27 16:35:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37366 states to 37366 states and 134384 transitions. [2019-12-27 16:35:59,909 INFO L78 Accepts]: Start accepts. Automaton has 37366 states and 134384 transitions. Word has length 42 [2019-12-27 16:35:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:35:59,909 INFO L462 AbstractCegarLoop]: Abstraction has 37366 states and 134384 transitions. [2019-12-27 16:35:59,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:35:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 37366 states and 134384 transitions. [2019-12-27 16:35:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:35:59,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:35:59,966 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] [2019-12-27 16:35:59,966 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:35:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:35:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash 202910430, now seen corresponding path program 2 times [2019-12-27 16:35:59,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:35:59,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383819029] [2019-12-27 16:35:59,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:35:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:00,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383819029] [2019-12-27 16:36:00,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:00,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:36:00,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522260366] [2019-12-27 16:36:00,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:00,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:00,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 210 transitions. [2019-12-27 16:36:00,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:00,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:36:00,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:36:00,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:36:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:36:00,096 INFO L87 Difference]: Start difference. First operand 37366 states and 134384 transitions. Second operand 4 states. [2019-12-27 16:36:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:00,501 INFO L93 Difference]: Finished difference Result 62473 states and 216038 transitions. [2019-12-27 16:36:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:36:00,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 16:36:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:00,601 INFO L225 Difference]: With dead ends: 62473 [2019-12-27 16:36:00,601 INFO L226 Difference]: Without dead ends: 44377 [2019-12-27 16:36:00,601 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 16:36:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44377 states. [2019-12-27 16:36:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44377 to 35802. [2019-12-27 16:36:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35802 states. [2019-12-27 16:36:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35802 states to 35802 states and 112745 transitions. [2019-12-27 16:36:01,592 INFO L78 Accepts]: Start accepts. Automaton has 35802 states and 112745 transitions. Word has length 42 [2019-12-27 16:36:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:01,593 INFO L462 AbstractCegarLoop]: Abstraction has 35802 states and 112745 transitions. [2019-12-27 16:36:01,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:36:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35802 states and 112745 transitions. [2019-12-27 16:36:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 16:36:01,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:01,645 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] [2019-12-27 16:36:01,646 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-27 16:36:01,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:01,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520861955] [2019-12-27 16:36:01,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:01,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520861955] [2019-12-27 16:36:01,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:01,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:36:01,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410174926] [2019-12-27 16:36:01,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:01,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:01,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 261 transitions. [2019-12-27 16:36:01,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:01,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:36:01,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:36:01,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:36:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:36:01,836 INFO L87 Difference]: Start difference. First operand 35802 states and 112745 transitions. Second operand 8 states. [2019-12-27 16:36:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:02,058 INFO L93 Difference]: Finished difference Result 34305 states and 108906 transitions. [2019-12-27 16:36:02,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:36:02,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-12-27 16:36:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:02,084 INFO L225 Difference]: With dead ends: 34305 [2019-12-27 16:36:02,084 INFO L226 Difference]: Without dead ends: 15124 [2019-12-27 16:36:02,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:36:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15124 states. [2019-12-27 16:36:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15124 to 14028. [2019-12-27 16:36:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14028 states. [2019-12-27 16:36:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 44507 transitions. [2019-12-27 16:36:02,309 INFO L78 Accepts]: Start accepts. Automaton has 14028 states and 44507 transitions. Word has length 43 [2019-12-27 16:36:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:02,309 INFO L462 AbstractCegarLoop]: Abstraction has 14028 states and 44507 transitions. [2019-12-27 16:36:02,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:36:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14028 states and 44507 transitions. [2019-12-27 16:36:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:02,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:02,325 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] [2019-12-27 16:36:02,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash 183004383, now seen corresponding path program 1 times [2019-12-27 16:36:02,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:02,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454346527] [2019-12-27 16:36:02,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:02,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454346527] [2019-12-27 16:36:02,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:02,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:36:02,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418833277] [2019-12-27 16:36:02,420 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:02,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:02,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 377 states and 661 transitions. [2019-12-27 16:36:02,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:02,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:36:02,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:36:02,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:36:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:36:02,821 INFO L87 Difference]: Start difference. First operand 14028 states and 44507 transitions. Second operand 7 states. [2019-12-27 16:36:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:03,236 INFO L93 Difference]: Finished difference Result 40387 states and 126492 transitions. [2019-12-27 16:36:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:36:03,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:36:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:03,282 INFO L225 Difference]: With dead ends: 40387 [2019-12-27 16:36:03,282 INFO L226 Difference]: Without dead ends: 30105 [2019-12-27 16:36:03,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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 16:36:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30105 states. [2019-12-27 16:36:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30105 to 17930. [2019-12-27 16:36:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17930 states. [2019-12-27 16:36:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17930 states to 17930 states and 56900 transitions. [2019-12-27 16:36:03,666 INFO L78 Accepts]: Start accepts. Automaton has 17930 states and 56900 transitions. Word has length 57 [2019-12-27 16:36:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:03,666 INFO L462 AbstractCegarLoop]: Abstraction has 17930 states and 56900 transitions. [2019-12-27 16:36:03,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:36:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 17930 states and 56900 transitions. [2019-12-27 16:36:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:03,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:03,686 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] [2019-12-27 16:36:03,687 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1661763349, now seen corresponding path program 2 times [2019-12-27 16:36:03,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:03,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393864597] [2019-12-27 16:36:03,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:03,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393864597] [2019-12-27 16:36:03,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:03,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:36:03,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1964037585] [2019-12-27 16:36:03,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:03,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:04,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 365 states and 712 transitions. [2019-12-27 16:36:04,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:04,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 16:36:04,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:36:04,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:36:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:36:04,652 INFO L87 Difference]: Start difference. First operand 17930 states and 56900 transitions. Second operand 13 states. [2019-12-27 16:36:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:11,859 INFO L93 Difference]: Finished difference Result 133235 states and 418081 transitions. [2019-12-27 16:36:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-27 16:36:11,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 16:36:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:12,100 INFO L225 Difference]: With dead ends: 133235 [2019-12-27 16:36:12,100 INFO L226 Difference]: Without dead ends: 99077 [2019-12-27 16:36:12,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1056, Invalid=4200, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 16:36:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99077 states. [2019-12-27 16:36:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99077 to 27555. [2019-12-27 16:36:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27555 states. [2019-12-27 16:36:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27555 states to 27555 states and 88046 transitions. [2019-12-27 16:36:13,453 INFO L78 Accepts]: Start accepts. Automaton has 27555 states and 88046 transitions. Word has length 57 [2019-12-27 16:36:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:13,453 INFO L462 AbstractCegarLoop]: Abstraction has 27555 states and 88046 transitions. [2019-12-27 16:36:13,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:36:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27555 states and 88046 transitions. [2019-12-27 16:36:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:13,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:13,485 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] [2019-12-27 16:36:13,485 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1472571948, now seen corresponding path program 1 times [2019-12-27 16:36:13,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489771452] [2019-12-27 16:36:13,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:13,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489771452] [2019-12-27 16:36:13,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:13,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:36:13,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909607089] [2019-12-27 16:36:13,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:13,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:13,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 16:36:13,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:13,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:36:13,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:36:13,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:36:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:36:13,818 INFO L87 Difference]: Start difference. First operand 27555 states and 88046 transitions. Second operand 3 states. [2019-12-27 16:36:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:14,030 INFO L93 Difference]: Finished difference Result 31985 states and 99636 transitions. [2019-12-27 16:36:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:36:14,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:36:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:14,095 INFO L225 Difference]: With dead ends: 31985 [2019-12-27 16:36:14,096 INFO L226 Difference]: Without dead ends: 31985 [2019-12-27 16:36:14,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:36:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31985 states. [2019-12-27 16:36:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31985 to 25051. [2019-12-27 16:36:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25051 states. [2019-12-27 16:36:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25051 states to 25051 states and 78827 transitions. [2019-12-27 16:36:15,003 INFO L78 Accepts]: Start accepts. Automaton has 25051 states and 78827 transitions. Word has length 57 [2019-12-27 16:36:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:15,003 INFO L462 AbstractCegarLoop]: Abstraction has 25051 states and 78827 transitions. [2019-12-27 16:36:15,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:36:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 25051 states and 78827 transitions. [2019-12-27 16:36:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:15,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:15,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:36:15,039 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1307076897, now seen corresponding path program 3 times [2019-12-27 16:36:15,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:15,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142816020] [2019-12-27 16:36:15,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:15,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142816020] [2019-12-27 16:36:15,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:15,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:36:15,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607190182] [2019-12-27 16:36:15,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:15,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:15,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 16:36:15,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:15,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:36:15,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:36:15,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:15,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:36:15,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:36:15,560 INFO L87 Difference]: Start difference. First operand 25051 states and 78827 transitions. Second operand 11 states. [2019-12-27 16:36:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:18,086 INFO L93 Difference]: Finished difference Result 89113 states and 271533 transitions. [2019-12-27 16:36:18,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 16:36:18,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 16:36:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:18,208 INFO L225 Difference]: With dead ends: 89113 [2019-12-27 16:36:18,209 INFO L226 Difference]: Without dead ends: 81436 [2019-12-27 16:36:18,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:36:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81436 states. [2019-12-27 16:36:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81436 to 25101. [2019-12-27 16:36:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25101 states. [2019-12-27 16:36:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25101 states to 25101 states and 79022 transitions. [2019-12-27 16:36:19,076 INFO L78 Accepts]: Start accepts. Automaton has 25101 states and 79022 transitions. Word has length 57 [2019-12-27 16:36:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:19,076 INFO L462 AbstractCegarLoop]: Abstraction has 25101 states and 79022 transitions. [2019-12-27 16:36:19,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:36:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 25101 states and 79022 transitions. [2019-12-27 16:36:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:19,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:19,107 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] [2019-12-27 16:36:19,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1928060516, now seen corresponding path program 1 times [2019-12-27 16:36:19,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:19,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812687133] [2019-12-27 16:36:19,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:19,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812687133] [2019-12-27 16:36:19,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:36:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933729310] [2019-12-27 16:36:19,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:19,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:19,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 326 transitions. [2019-12-27 16:36:19,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:19,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:36:19,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:36:19,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:36:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:36:19,631 INFO L87 Difference]: Start difference. First operand 25101 states and 79022 transitions. Second operand 3 states. [2019-12-27 16:36:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:19,733 INFO L93 Difference]: Finished difference Result 26687 states and 81687 transitions. [2019-12-27 16:36:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:36:19,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:36:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:19,770 INFO L225 Difference]: With dead ends: 26687 [2019-12-27 16:36:19,770 INFO L226 Difference]: Without dead ends: 26687 [2019-12-27 16:36:19,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:36:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26687 states. [2019-12-27 16:36:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26687 to 20263. [2019-12-27 16:36:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20263 states. [2019-12-27 16:36:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20263 states to 20263 states and 62421 transitions. [2019-12-27 16:36:20,126 INFO L78 Accepts]: Start accepts. Automaton has 20263 states and 62421 transitions. Word has length 57 [2019-12-27 16:36:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:20,127 INFO L462 AbstractCegarLoop]: Abstraction has 20263 states and 62421 transitions. [2019-12-27 16:36:20,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:36:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20263 states and 62421 transitions. [2019-12-27 16:36:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:20,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:20,150 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] [2019-12-27 16:36:20,150 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1461027575, now seen corresponding path program 4 times [2019-12-27 16:36:20,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:20,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523098153] [2019-12-27 16:36:20,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:20,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523098153] [2019-12-27 16:36:20,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:20,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:36:20,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983591796] [2019-12-27 16:36:20,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:20,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:20,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 321 states and 609 transitions. [2019-12-27 16:36:20,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:20,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:36:20,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:36:20,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:36:20,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:36:20,776 INFO L87 Difference]: Start difference. First operand 20263 states and 62421 transitions. Second operand 9 states. [2019-12-27 16:36:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:22,231 INFO L93 Difference]: Finished difference Result 48523 states and 146153 transitions. [2019-12-27 16:36:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:36:22,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 16:36:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:22,290 INFO L225 Difference]: With dead ends: 48523 [2019-12-27 16:36:22,291 INFO L226 Difference]: Without dead ends: 41911 [2019-12-27 16:36:22,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:36:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41911 states. [2019-12-27 16:36:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41911 to 20479. [2019-12-27 16:36:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20479 states. [2019-12-27 16:36:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20479 states to 20479 states and 63058 transitions. [2019-12-27 16:36:22,756 INFO L78 Accepts]: Start accepts. Automaton has 20479 states and 63058 transitions. Word has length 57 [2019-12-27 16:36:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:22,756 INFO L462 AbstractCegarLoop]: Abstraction has 20479 states and 63058 transitions. [2019-12-27 16:36:22,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:36:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20479 states and 63058 transitions. [2019-12-27 16:36:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:22,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:22,777 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] [2019-12-27 16:36:22,777 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 5 times [2019-12-27 16:36:22,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:22,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591473946] [2019-12-27 16:36:22,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:22,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591473946] [2019-12-27 16:36:22,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:22,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:36:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747778716] [2019-12-27 16:36:22,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:22,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:23,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 433 states and 781 transitions. [2019-12-27 16:36:23,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:23,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:36:23,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:36:23,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:36:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:36:23,625 INFO L87 Difference]: Start difference. First operand 20479 states and 63058 transitions. Second operand 14 states. [2019-12-27 16:36:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:29,031 INFO L93 Difference]: Finished difference Result 66962 states and 198326 transitions. [2019-12-27 16:36:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 16:36:29,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 16:36:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:29,123 INFO L225 Difference]: With dead ends: 66962 [2019-12-27 16:36:29,124 INFO L226 Difference]: Without dead ends: 66962 [2019-12-27 16:36:29,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=611, Invalid=3421, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 16:36:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66962 states. [2019-12-27 16:36:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66962 to 25154. [2019-12-27 16:36:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25154 states. [2019-12-27 16:36:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25154 states to 25154 states and 76612 transitions. [2019-12-27 16:36:29,882 INFO L78 Accepts]: Start accepts. Automaton has 25154 states and 76612 transitions. Word has length 57 [2019-12-27 16:36:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:36:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 25154 states and 76612 transitions. [2019-12-27 16:36:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:36:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25154 states and 76612 transitions. [2019-12-27 16:36:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:36:29,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:29,910 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] [2019-12-27 16:36:29,911 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 6 times [2019-12-27 16:36:29,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:29,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509915414] [2019-12-27 16:36:29,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:36:30,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509915414] [2019-12-27 16:36:30,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:30,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:36:30,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171353879] [2019-12-27 16:36:30,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:30,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:30,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 343 states and 570 transitions. [2019-12-27 16:36:30,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:31,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 16:36:31,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:36:31,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:36:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:36:31,265 INFO L87 Difference]: Start difference. First operand 25154 states and 76612 transitions. Second operand 22 states. [2019-12-27 16:36:32,733 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 16:36:33,255 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 Received shutdown request... [2019-12-27 16:36:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 16:36:34,426 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 16:36:34,429 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 16:36:34,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:36:34 BasicIcfg [2019-12-27 16:36:34,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:36:34,432 INFO L168 Benchmark]: Toolchain (without parser) took 197337.55 ms. Allocated memory was 146.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,433 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.67 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 156.3 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.28 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,434 INFO L168 Benchmark]: Boogie Preprocessor took 83.91 ms. Allocated memory is still 205.0 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,435 INFO L168 Benchmark]: RCFGBuilder took 839.19 ms. Allocated memory is still 205.0 MB. Free memory was 151.1 MB in the beginning and 101.9 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,436 INFO L168 Benchmark]: TraceAbstraction took 195519.58 ms. Allocated memory was 205.0 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:36:34,445 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.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.67 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 156.3 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.28 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.91 ms. Allocated memory is still 205.0 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.19 ms. Allocated memory is still 205.0 MB. Free memory was 151.1 MB in the beginning and 101.9 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195519.58 ms. Allocated memory was 205.0 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (25154states) and FLOYD_HOARE automaton (currently 35 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (25154states) and FLOYD_HOARE automaton (currently 35 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: TIMEOUT, OverallTime: 195.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4557 SDtfs, 8081 SDslu, 14738 SDs, 0 SdLazy, 13693 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 152 SyntacticMatches, 30 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3819 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred 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: 88.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 387767 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 709 ConstructedInterpolants, 0 QuantifiedInterpolants, 124147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 could not prove your program: Timeout Completed graceful shutdown