/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:50:55,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:50:55,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:50:55,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:50:55,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:50:55,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:50:55,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:50:55,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:50:55,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:50:55,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:50:55,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:50:55,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:50:55,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:50:55,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:50:55,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:50:55,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:50:55,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:50:55,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:50:55,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:50:56,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:50:56,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:50:56,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:50:56,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:50:56,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:50:56,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:50:56,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:50:56,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:50:56,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:50:56,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:50:56,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:50:56,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:50:56,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:50:56,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:50:56,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:50:56,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:50:56,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:50:56,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:50:56,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:50:56,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:50:56,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:50:56,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:50:56,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:50:56,043 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:50:56,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:50:56,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:50:56,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:50:56,045 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:50:56,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:50:56,046 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:50:56,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:50:56,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:50:56,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:50:56,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:50:56,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:50:56,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:50:56,047 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:50:56,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:50:56,048 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:50:56,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:50:56,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:50:56,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:50:56,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:50:56,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:50:56,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:50:56,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:50:56,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:50:56,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:50:56,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:50:56,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:50:56,050 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:50:56,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:50:56,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:50:56,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:50:56,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:50:56,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:50:56,371 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:50:56,372 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-05 23:50:56,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c108b9f/8c8e234d44f6458b8a8d72289a974bc3/FLAGaf870d9d7 [2020-10-05 23:50:56,956 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:50:56,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-05 23:50:56,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c108b9f/8c8e234d44f6458b8a8d72289a974bc3/FLAGaf870d9d7 [2020-10-05 23:50:57,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c108b9f/8c8e234d44f6458b8a8d72289a974bc3 [2020-10-05 23:50:57,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:50:57,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:50:57,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:50:57,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:50:57,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:50:57,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:57,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b80bc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57, skipping insertion in model container [2020-10-05 23:50:57,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:57,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:50:57,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:50:57,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:50:57,862 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:50:57,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:50:57,993 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:50:57,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57 WrapperNode [2020-10-05 23:50:57,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:50:57,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:50:57,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:50:57,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:50:58,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:50:58,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:50:58,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:50:58,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:50:58,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (1/1) ... [2020-10-05 23:50:58,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:50:58,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:50:58,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:50:58,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:50:58,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (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 [2020-10-05 23:50:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-05 23:50:58,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-05 23:50:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-05 23:50:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-05 23:50:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:50:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:50:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:50:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:50:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:50:58,160 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:50:58,453 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:50:58,454 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-05 23:50:58,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:50:58 BoogieIcfgContainer [2020-10-05 23:50:58,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:50:58,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:50:58,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:50:58,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:50:58,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:50:57" (1/3) ... [2020-10-05 23:50:58,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693485f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:50:58, skipping insertion in model container [2020-10-05 23:50:58,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:57" (2/3) ... [2020-10-05 23:50:58,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693485f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:50:58, skipping insertion in model container [2020-10-05 23:50:58,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:50:58" (3/3) ... [2020-10-05 23:50:58,466 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2020-10-05 23:50:58,480 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:50:58,481 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:50:58,490 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 23:50:58,492 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:50:58,525 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,526 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,526 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,526 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,527 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,527 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,528 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,546 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,550 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,551 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:58,595 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-05 23:50:58,613 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:58,614 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:58,614 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:58,614 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:58,614 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:58,614 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:58,615 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:58,615 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:58,631 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:58,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:58,689 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:50:58,690 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:50:58,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:50:58,698 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:58,720 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:50:58,720 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:50:58,721 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:50:58,723 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-10-05 23:50:58,724 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:00,011 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-10-05 23:51:00,265 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-10-05 23:51:00,518 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2020-10-05 23:51:00,582 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-10-05 23:51:00,582 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-10-05 23:51:00,588 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-05 23:51:00,619 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-05 23:51:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-05 23:51:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:00,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:00,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:00,639 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-10-05 23:51:00,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:00,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420459911] [2020-10-05 23:51:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:00,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420459911] [2020-10-05 23:51:00,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:00,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:00,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357192036] [2020-10-05 23:51:00,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:00,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:00,863 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-05 23:51:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:00,897 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-05 23:51:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:00,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:00,911 INFO L225 Difference]: With dead ends: 35 [2020-10-05 23:51:00,911 INFO L226 Difference]: Without dead ends: 31 [2020-10-05 23:51:00,913 INFO L675 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 [2020-10-05 23:51:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-05 23:51:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-05 23:51:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-05 23:51:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-05 23:51:00,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-05 23:51:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:00,953 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-05 23:51:00,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-05 23:51:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:51:00,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:00,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:00,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:51:00,955 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-10-05 23:51:00,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:00,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759744314] [2020-10-05 23:51:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:01,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759744314] [2020-10-05 23:51:01,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:01,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:51:01,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878963502] [2020-10-05 23:51:01,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:51:01,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:51:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:51:01,045 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-05 23:51:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:01,076 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-05 23:51:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:51:01,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-05 23:51:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:01,078 INFO L225 Difference]: With dead ends: 26 [2020-10-05 23:51:01,078 INFO L226 Difference]: Without dead ends: 24 [2020-10-05 23:51:01,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:51:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-05 23:51:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-05 23:51:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:51:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-05 23:51:01,090 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-05 23:51:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:01,090 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-05 23:51:01,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:51:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-05 23:51:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:51:01,091 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:01,091 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:01,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:51:01,092 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-10-05 23:51:01,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:01,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726893344] [2020-10-05 23:51:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:01,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:01,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:01,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:51:01,155 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:51:01,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:51:01,156 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:51:01,157 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:51:01,157 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-05 23:51:01,166 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,166 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,167 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,167 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,167 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,167 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,167 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,168 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,168 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,168 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,168 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,174 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,174 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,176 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,176 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,176 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,176 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,177 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:01,183 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:51:01,183 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:51:01,183 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:51:01,183 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:51:01,183 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:51:01,184 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:51:01,184 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:51:01,184 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:51:01,184 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:51:01,187 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-10-05 23:51:01,187 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:51:01,220 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:51:01,223 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:51:01,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:51:01,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:51:01,261 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:51:01,262 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:51:01,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:51:01,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-10-05 23:51:01,266 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:02,660 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:51:02,800 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:51:02,806 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-10-05 23:51:02,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-10-05 23:51:02,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-05 23:51:02,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-05 23:51:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-05 23:51:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:02,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:02,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:02,821 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-10-05 23:51:02,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:02,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208517452] [2020-10-05 23:51:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:02,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208517452] [2020-10-05 23:51:02,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:02,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:02,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307328846] [2020-10-05 23:51:02,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:02,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:02,865 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-05 23:51:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:02,897 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-05 23:51:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:02,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:02,902 INFO L225 Difference]: With dead ends: 185 [2020-10-05 23:51:02,902 INFO L226 Difference]: Without dead ends: 171 [2020-10-05 23:51:02,903 INFO L675 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 [2020-10-05 23:51:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-05 23:51:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-05 23:51:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-05 23:51:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-05 23:51:02,932 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-05 23:51:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:02,932 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-05 23:51:02,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-05 23:51:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:51:02,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:02,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:02,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:51:02,934 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-10-05 23:51:02,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:02,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664906867] [2020-10-05 23:51:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:02,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664906867] [2020-10-05 23:51:02,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:02,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:02,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000840582] [2020-10-05 23:51:02,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:02,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:02,994 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-05 23:51:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:03,104 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-05 23:51:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:03,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:51:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:03,108 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:51:03,108 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:51:03,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:51:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-05 23:51:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:51:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-05 23:51:03,128 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-05 23:51:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:03,128 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-05 23:51:03,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-05 23:51:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:51:03,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:03,130 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:03,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:51:03,130 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-10-05 23:51:03,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:03,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832752405] [2020-10-05 23:51:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:03,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832752405] [2020-10-05 23:51:03,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:03,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:03,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763696944] [2020-10-05 23:51:03,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:03,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:03,194 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-05 23:51:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:03,273 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-05 23:51:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:03,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:51:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:03,276 INFO L225 Difference]: With dead ends: 189 [2020-10-05 23:51:03,276 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:51:03,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:51:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-05 23:51:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:51:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-05 23:51:03,291 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-05 23:51:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:03,292 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-05 23:51:03,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-05 23:51:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:51:03,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:03,294 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:03,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:51:03,295 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-10-05 23:51:03,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:03,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634093125] [2020-10-05 23:51:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:03,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:03,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:03,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:51:03,333 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:51:03,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:51:03,334 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:51:03,335 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:51:03,336 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-05 23:51:03,347 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,347 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,349 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,351 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,358 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,358 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,358 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,359 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,359 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,360 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,360 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,360 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,361 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,361 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,364 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,364 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:03,382 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:51:03,382 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:51:03,382 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:51:03,382 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:51:03,382 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:51:03,383 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:51:03,383 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:51:03,383 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:51:03,383 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:51:03,386 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-10-05 23:51:03,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:51:03,431 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:51:03,432 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:51:03,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:51:03,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:51:03,465 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:51:03,465 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:51:03,467 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:51:03,470 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-10-05 23:51:03,470 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:04,730 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-10-05 23:51:04,978 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:51:05,117 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:51:05,123 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-10-05 23:51:05,123 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:51:05,124 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-05 23:51:05,152 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-05 23:51:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-05 23:51:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:05,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:05,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:05,153 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-10-05 23:51:05,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:05,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094945822] [2020-10-05 23:51:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:05,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094945822] [2020-10-05 23:51:05,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:05,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:05,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038901591] [2020-10-05 23:51:05,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:05,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:05,197 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-05 23:51:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:05,236 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-05 23:51:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:05,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:05,243 INFO L225 Difference]: With dead ends: 600 [2020-10-05 23:51:05,243 INFO L226 Difference]: Without dead ends: 559 [2020-10-05 23:51:05,244 INFO L675 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 [2020-10-05 23:51:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-05 23:51:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-05 23:51:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-05 23:51:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-05 23:51:05,289 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-05 23:51:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:05,290 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-05 23:51:05,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-05 23:51:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:51:05,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:05,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:05,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:51:05,291 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-10-05 23:51:05,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:05,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480779844] [2020-10-05 23:51:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:05,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480779844] [2020-10-05 23:51:05,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:05,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:05,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953472363] [2020-10-05 23:51:05,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:05,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:05,339 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-05 23:51:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:05,460 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-05 23:51:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:05,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:51:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:05,471 INFO L225 Difference]: With dead ends: 817 [2020-10-05 23:51:05,471 INFO L226 Difference]: Without dead ends: 812 [2020-10-05 23:51:05,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-05 23:51:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-05 23:51:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-05 23:51:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-05 23:51:05,510 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-05 23:51:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:05,511 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-05 23:51:05,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-05 23:51:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:51:05,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:05,518 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:05,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:51:05,519 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-10-05 23:51:05,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:05,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947878087] [2020-10-05 23:51:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:05,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947878087] [2020-10-05 23:51:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667002699] [2020-10-05 23:51:05,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:05,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:05,618 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-05 23:51:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:05,715 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-05 23:51:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:05,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:51:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:05,722 INFO L225 Difference]: With dead ends: 843 [2020-10-05 23:51:05,723 INFO L226 Difference]: Without dead ends: 836 [2020-10-05 23:51:05,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-05 23:51:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-05 23:51:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-05 23:51:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-05 23:51:05,754 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-05 23:51:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:05,754 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-05 23:51:05,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-05 23:51:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:05,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:05,757 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:05,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:51:05,758 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-10-05 23:51:05,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:05,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253884136] [2020-10-05 23:51:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:05,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253884136] [2020-10-05 23:51:05,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314910807] [2020-10-05 23:51:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:06,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:06,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:06,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:06,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:06,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926209745] [2020-10-05 23:51:06,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:06,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:06,112 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 12 states. [2020-10-05 23:51:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:06,401 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-05 23:51:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:06,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:51:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:06,412 INFO L225 Difference]: With dead ends: 1059 [2020-10-05 23:51:06,412 INFO L226 Difference]: Without dead ends: 1052 [2020-10-05 23:51:06,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-05 23:51:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-05 23:51:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-05 23:51:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-05 23:51:06,442 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-05 23:51:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:06,442 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-05 23:51:06,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-05 23:51:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:06,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:06,443 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:06,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-05 23:51:06,658 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-10-05 23:51:06,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:06,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637522274] [2020-10-05 23:51:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:06,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637522274] [2020-10-05 23:51:06,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:06,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:06,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772983357] [2020-10-05 23:51:06,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:06,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:06,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:06,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:06,719 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-05 23:51:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:06,991 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-05 23:51:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:06,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:51:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:07,002 INFO L225 Difference]: With dead ends: 1053 [2020-10-05 23:51:07,002 INFO L226 Difference]: Without dead ends: 1045 [2020-10-05 23:51:07,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-05 23:51:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-05 23:51:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 23:51:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-05 23:51:07,031 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-05 23:51:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:07,031 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-05 23:51:07,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-05 23:51:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:51:07,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:07,033 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:07,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:51:07,033 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-10-05 23:51:07,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:07,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298062231] [2020-10-05 23:51:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:07,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298062231] [2020-10-05 23:51:07,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:07,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:07,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090956653] [2020-10-05 23:51:07,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:07,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:07,123 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-05 23:51:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:07,210 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-05 23:51:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:07,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:51:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:07,216 INFO L225 Difference]: With dead ends: 736 [2020-10-05 23:51:07,217 INFO L226 Difference]: Without dead ends: 728 [2020-10-05 23:51:07,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-05 23:51:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-05 23:51:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:51:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-05 23:51:07,238 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-05 23:51:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:07,239 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-05 23:51:07,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-05 23:51:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:51:07,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:07,240 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:07,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:51:07,240 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-10-05 23:51:07,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:07,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314153306] [2020-10-05 23:51:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:07,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:07,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:07,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:51:07,283 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:51:07,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:51:07,283 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:51:07,284 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:51:07,284 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-05 23:51:07,300 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,300 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,300 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,300 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,301 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,301 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,301 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,301 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,302 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,303 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,304 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:07,328 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:51:07,329 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:51:07,329 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:51:07,329 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:51:07,329 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:51:07,329 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:51:07,329 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:51:07,329 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:51:07,330 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:51:07,331 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-10-05 23:51:07,331 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:51:07,357 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:51:07,357 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:51:07,358 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:51:07,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:51:07,383 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:51:07,383 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:51:07,384 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:51:07,387 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-10-05 23:51:07,387 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:08,847 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-05 23:51:09,126 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-10-05 23:51:09,296 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:51:09,388 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-10-05 23:51:09,388 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:51:09,389 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-05 23:51:09,502 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-05 23:51:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-05 23:51:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:09,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:09,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:09,503 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-10-05 23:51:09,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:09,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612233129] [2020-10-05 23:51:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:09,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612233129] [2020-10-05 23:51:09,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:09,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:09,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364249542] [2020-10-05 23:51:09,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:09,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:09,529 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-05 23:51:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:09,578 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-05 23:51:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:09,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:09,595 INFO L225 Difference]: With dead ends: 1889 [2020-10-05 23:51:09,595 INFO L226 Difference]: Without dead ends: 1767 [2020-10-05 23:51:09,596 INFO L675 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 [2020-10-05 23:51:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-05 23:51:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-05 23:51:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-05 23:51:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-05 23:51:09,679 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-05 23:51:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:09,679 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-05 23:51:09,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-05 23:51:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:51:09,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:09,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:09,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:51:09,681 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-10-05 23:51:09,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:09,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909216027] [2020-10-05 23:51:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:09,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909216027] [2020-10-05 23:51:09,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:09,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:09,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369347794] [2020-10-05 23:51:09,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:09,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:09,718 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-05 23:51:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:09,819 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-05 23:51:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:09,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:51:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:09,848 INFO L225 Difference]: With dead ends: 2905 [2020-10-05 23:51:09,848 INFO L226 Difference]: Without dead ends: 2899 [2020-10-05 23:51:09,849 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-05 23:51:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-05 23:51:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-05 23:51:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-05 23:51:10,006 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-05 23:51:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:10,006 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-05 23:51:10,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-05 23:51:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:51:10,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:10,007 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:10,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:51:10,008 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-10-05 23:51:10,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:10,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441959925] [2020-10-05 23:51:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:10,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441959925] [2020-10-05 23:51:10,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:10,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:10,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419929407] [2020-10-05 23:51:10,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:10,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:10,051 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-05 23:51:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:10,169 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-05 23:51:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:10,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:51:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:10,196 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:51:10,196 INFO L226 Difference]: Without dead ends: 3194 [2020-10-05 23:51:10,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-05 23:51:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-05 23:51:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-05 23:51:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-05 23:51:10,302 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-05 23:51:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:10,302 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-05 23:51:10,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-05 23:51:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:10,303 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:10,303 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:10,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:51:10,304 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-10-05 23:51:10,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:10,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880886252] [2020-10-05 23:51:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:10,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880886252] [2020-10-05 23:51:10,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947258724] [2020-10-05 23:51:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:10,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:10,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:10,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:10,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:10,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953010476] [2020-10-05 23:51:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:10,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:10,516 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 12 states. [2020-10-05 23:51:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:10,842 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-05 23:51:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:10,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:51:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:10,888 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 23:51:10,888 INFO L226 Difference]: Without dead ends: 4546 [2020-10-05 23:51:10,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-05 23:51:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-05 23:51:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-05 23:51:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-05 23:51:11,010 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-05 23:51:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:11,011 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-05 23:51:11,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-05 23:51:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:11,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:11,012 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:11,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-05 23:51:11,226 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-10-05 23:51:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:11,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011663137] [2020-10-05 23:51:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:11,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011663137] [2020-10-05 23:51:11,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:11,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:11,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558453153] [2020-10-05 23:51:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:11,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:11,291 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-05 23:51:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:11,631 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-05 23:51:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:11,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:51:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:11,650 INFO L225 Difference]: With dead ends: 4612 [2020-10-05 23:51:11,650 INFO L226 Difference]: Without dead ends: 4601 [2020-10-05 23:51:11,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-05 23:51:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-05 23:51:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-05 23:51:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-05 23:51:11,756 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-05 23:51:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:11,756 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-05 23:51:11,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-05 23:51:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:51:11,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:11,757 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:11,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:51:11,758 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-10-05 23:51:11,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:11,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790731352] [2020-10-05 23:51:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:11,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790731352] [2020-10-05 23:51:11,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:11,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:11,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860477228] [2020-10-05 23:51:11,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:11,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:11,808 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-05 23:51:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:11,919 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-05 23:51:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:11,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:51:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:11,931 INFO L225 Difference]: With dead ends: 3265 [2020-10-05 23:51:11,932 INFO L226 Difference]: Without dead ends: 3250 [2020-10-05 23:51:11,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-05 23:51:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-05 23:51:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-05 23:51:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-05 23:51:12,024 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-05 23:51:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:12,024 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-05 23:51:12,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-05 23:51:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:12,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:12,026 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:12,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:51:12,026 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-10-05 23:51:12,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:12,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153737141] [2020-10-05 23:51:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:12,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153737141] [2020-10-05 23:51:12,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776991167] [2020-10-05 23:51:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:12,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:12,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:12,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:12,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:12,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290919185] [2020-10-05 23:51:12,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:12,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:12,261 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 12 states. [2020-10-05 23:51:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:12,632 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-05 23:51:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:12,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:12,651 INFO L225 Difference]: With dead ends: 4825 [2020-10-05 23:51:12,651 INFO L226 Difference]: Without dead ends: 4813 [2020-10-05 23:51:12,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-05 23:51:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-05 23:51:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-05 23:51:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-05 23:51:12,841 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-05 23:51:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:12,842 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-05 23:51:12,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-05 23:51:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:12,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:12,846 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:13,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:13,061 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-10-05 23:51:13,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:13,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139976570] [2020-10-05 23:51:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:13,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139976570] [2020-10-05 23:51:13,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053848731] [2020-10-05 23:51:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:13,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:13,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:13,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:13,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82699209] [2020-10-05 23:51:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:13,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:13,282 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 12 states. [2020-10-05 23:51:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:13,673 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-05 23:51:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:13,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:13,692 INFO L225 Difference]: With dead ends: 4942 [2020-10-05 23:51:13,692 INFO L226 Difference]: Without dead ends: 4925 [2020-10-05 23:51:13,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-05 23:51:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-05 23:51:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-05 23:51:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-05 23:51:13,799 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-05 23:51:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:13,799 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-05 23:51:13,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-05 23:51:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:13,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:13,801 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:14,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:14,015 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-10-05 23:51:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:14,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351931855] [2020-10-05 23:51:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:14,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351931855] [2020-10-05 23:51:14,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:14,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:14,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861206743] [2020-10-05 23:51:14,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:14,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:14,096 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-05 23:51:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:14,422 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-05 23:51:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:14,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:51:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:14,444 INFO L225 Difference]: With dead ends: 4934 [2020-10-05 23:51:14,444 INFO L226 Difference]: Without dead ends: 4917 [2020-10-05 23:51:14,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-05 23:51:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-05 23:51:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:51:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-05 23:51:14,560 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-05 23:51:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:14,561 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-05 23:51:14,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-05 23:51:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:14,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:14,563 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:14,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:51:14,564 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-10-05 23:51:14,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:14,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684197959] [2020-10-05 23:51:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:14,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684197959] [2020-10-05 23:51:14,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:14,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:14,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233201696] [2020-10-05 23:51:14,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:14,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:14,738 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-05 23:51:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:15,044 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-05 23:51:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:15,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:51:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:15,060 INFO L225 Difference]: With dead ends: 4774 [2020-10-05 23:51:15,060 INFO L226 Difference]: Without dead ends: 4757 [2020-10-05 23:51:15,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-05 23:51:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-05 23:51:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-05 23:51:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-05 23:51:15,157 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-05 23:51:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:15,157 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-05 23:51:15,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-05 23:51:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:15,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:15,159 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:15,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:51:15,159 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-10-05 23:51:15,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:15,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285852689] [2020-10-05 23:51:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:15,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285852689] [2020-10-05 23:51:15,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111897868] [2020-10-05 23:51:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:15,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:15,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:15,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:15,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:15,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191400995] [2020-10-05 23:51:15,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:15,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:15,409 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 16 states. [2020-10-05 23:51:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:16,247 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-05 23:51:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:16,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:16,267 INFO L225 Difference]: With dead ends: 6025 [2020-10-05 23:51:16,268 INFO L226 Difference]: Without dead ends: 6017 [2020-10-05 23:51:16,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-05 23:51:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-05 23:51:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-05 23:51:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-05 23:51:16,469 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-05 23:51:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:16,472 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-05 23:51:16,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-05 23:51:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:16,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:16,474 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:16,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-05 23:51:16,687 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-10-05 23:51:16,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:16,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274754106] [2020-10-05 23:51:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:16,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274754106] [2020-10-05 23:51:16,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82340369] [2020-10-05 23:51:16,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:16,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:16,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:16,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:16,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:16,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:16,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:16,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226906819] [2020-10-05 23:51:16,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:16,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:16,962 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 16 states. [2020-10-05 23:51:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:17,777 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-05 23:51:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:17,777 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:17,788 INFO L225 Difference]: With dead ends: 5914 [2020-10-05 23:51:17,788 INFO L226 Difference]: Without dead ends: 5903 [2020-10-05 23:51:17,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-05 23:51:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-05 23:51:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-05 23:51:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-05 23:51:17,886 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-05 23:51:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:17,887 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-05 23:51:17,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-05 23:51:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:17,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:17,889 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:18,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:18,105 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-10-05 23:51:18,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:18,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230017134] [2020-10-05 23:51:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:18,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230017134] [2020-10-05 23:51:18,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700430646] [2020-10-05 23:51:18,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:18,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:51:18,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:18,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:18,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:18,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:18,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:18,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891258240] [2020-10-05 23:51:18,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:18,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:18,376 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 16 states. [2020-10-05 23:51:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:19,213 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-05 23:51:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:19,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:19,225 INFO L225 Difference]: With dead ends: 5907 [2020-10-05 23:51:19,225 INFO L226 Difference]: Without dead ends: 5899 [2020-10-05 23:51:19,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-05 23:51:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-05 23:51:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-05 23:51:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-05 23:51:19,314 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-05 23:51:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:19,315 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-05 23:51:19,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-05 23:51:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:19,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:19,317 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:19,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-05 23:51:19,530 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-10-05 23:51:19,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:19,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984167074] [2020-10-05 23:51:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:19,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984167074] [2020-10-05 23:51:19,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816983739] [2020-10-05 23:51:19,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:19,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:51:19,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:19,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:19,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:19,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:19,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296143992] [2020-10-05 23:51:19,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:19,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:19,813 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 16 states. [2020-10-05 23:51:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:20,647 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-05 23:51:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:20,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:20,659 INFO L225 Difference]: With dead ends: 5835 [2020-10-05 23:51:20,660 INFO L226 Difference]: Without dead ends: 5824 [2020-10-05 23:51:20,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-05 23:51:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-05 23:51:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-05 23:51:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-05 23:51:20,747 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-05 23:51:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:20,747 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-05 23:51:20,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-05 23:51:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:20,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:20,750 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:20,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-05 23:51:20,962 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-10-05 23:51:20,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:20,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156197672] [2020-10-05 23:51:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:21,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156197672] [2020-10-05 23:51:21,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:21,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828641131] [2020-10-05 23:51:21,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:21,101 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-10-05 23:51:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:21,819 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-10-05 23:51:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:21,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:51:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:21,831 INFO L225 Difference]: With dead ends: 5820 [2020-10-05 23:51:21,831 INFO L226 Difference]: Without dead ends: 5812 [2020-10-05 23:51:21,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-10-05 23:51:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-10-05 23:51:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-05 23:51:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-10-05 23:51:21,897 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-10-05 23:51:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:21,898 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-10-05 23:51:21,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-10-05 23:51:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:21,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:21,899 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:21,899 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:51:21,900 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-10-05 23:51:21,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:21,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358707645] [2020-10-05 23:51:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:21,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358707645] [2020-10-05 23:51:21,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:21,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:21,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559967890] [2020-10-05 23:51:21,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:21,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:21,977 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-10-05 23:51:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:22,696 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-10-05 23:51:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:22,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:51:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:22,707 INFO L225 Difference]: With dead ends: 5717 [2020-10-05 23:51:22,707 INFO L226 Difference]: Without dead ends: 5705 [2020-10-05 23:51:22,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-10-05 23:51:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-10-05 23:51:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-10-05 23:51:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-10-05 23:51:22,802 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-10-05 23:51:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:22,803 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-10-05 23:51:22,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-10-05 23:51:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:22,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:22,804 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:22,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:51:22,805 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-10-05 23:51:22,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:22,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632919614] [2020-10-05 23:51:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:22,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632919614] [2020-10-05 23:51:22,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:22,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:22,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471587345] [2020-10-05 23:51:22,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:22,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:22,846 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-10-05 23:51:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:22,945 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-10-05 23:51:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:22,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:51:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:22,954 INFO L225 Difference]: With dead ends: 2762 [2020-10-05 23:51:22,954 INFO L226 Difference]: Without dead ends: 2746 [2020-10-05 23:51:22,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-10-05 23:51:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-10-05 23:51:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-05 23:51:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-05 23:51:23,027 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-05 23:51:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:23,028 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-05 23:51:23,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-05 23:51:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:51:23,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:23,031 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:23,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:51:23,032 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:51:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-10-05 23:51:23,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:23,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670311367] [2020-10-05 23:51:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:23,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:23,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:23,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:51:23,076 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:51:23,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 23:51:23,077 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:51:23,078 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:51:23,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-05 23:51:23,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,099 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,100 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,102 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,104 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,105 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,106 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,116 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,116 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,117 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,117 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,117 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,124 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,125 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,125 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,125 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,126 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,127 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,127 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,127 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,127 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,128 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,128 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,128 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,129 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,129 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,130 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,130 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,130 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:23,141 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:51:23,142 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:51:23,142 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:51:23,142 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:51:23,142 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:51:23,142 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:51:23,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:51:23,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:51:23,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:51:23,147 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-10-05 23:51:23,147 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:51:23,170 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:51:23,170 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:51:23,171 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:51:23,176 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:51:23,233 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:51:23,233 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:51:23,234 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:51:23,238 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-10-05 23:51:23,238 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:24,983 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-10-05 23:51:25,196 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:51:25,282 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-10-05 23:51:25,283 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-10-05 23:51:25,283 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-05 23:51:25,782 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-05 23:51:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-05 23:51:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:25,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:25,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:25,783 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-10-05 23:51:25,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:25,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061718099] [2020-10-05 23:51:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:25,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061718099] [2020-10-05 23:51:25,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:25,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:25,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837980370] [2020-10-05 23:51:25,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:25,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:25,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:25,799 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-05 23:51:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:25,873 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-05 23:51:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:25,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:25,894 INFO L225 Difference]: With dead ends: 5844 [2020-10-05 23:51:25,894 INFO L226 Difference]: Without dead ends: 5479 [2020-10-05 23:51:25,895 INFO L675 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 [2020-10-05 23:51:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-05 23:51:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-05 23:51:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-05 23:51:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-05 23:51:26,188 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-05 23:51:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:26,188 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-05 23:51:26,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-05 23:51:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:51:26,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:26,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:26,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 23:51:26,190 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-10-05 23:51:26,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:26,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615430257] [2020-10-05 23:51:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:26,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615430257] [2020-10-05 23:51:26,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:26,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:26,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801727768] [2020-10-05 23:51:26,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:26,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:26,250 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-05 23:51:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:26,442 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-05 23:51:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:26,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:51:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:26,477 INFO L225 Difference]: With dead ends: 9673 [2020-10-05 23:51:26,478 INFO L226 Difference]: Without dead ends: 9666 [2020-10-05 23:51:26,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-05 23:51:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-05 23:51:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-05 23:51:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-05 23:51:26,760 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-05 23:51:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:26,761 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-05 23:51:26,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-05 23:51:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:51:26,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:26,761 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:26,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 23:51:26,762 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-10-05 23:51:26,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:26,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205175324] [2020-10-05 23:51:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:26,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205175324] [2020-10-05 23:51:26,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:26,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:26,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506293897] [2020-10-05 23:51:26,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:26,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:26,795 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-05 23:51:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:26,962 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-05 23:51:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:26,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:51:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:26,995 INFO L225 Difference]: With dead ends: 11081 [2020-10-05 23:51:26,995 INFO L226 Difference]: Without dead ends: 11068 [2020-10-05 23:51:26,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-05 23:51:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-05 23:51:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-05 23:51:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-05 23:51:27,953 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-05 23:51:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:27,953 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-05 23:51:27,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-05 23:51:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:27,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:27,954 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:27,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 23:51:27,954 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-10-05 23:51:27,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:27,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967240015] [2020-10-05 23:51:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:28,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967240015] [2020-10-05 23:51:28,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900904925] [2020-10-05 23:51:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:28,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:28,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:28,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:28,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:28,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13332328] [2020-10-05 23:51:28,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:28,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:28,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:28,142 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 12 states. [2020-10-05 23:51:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:28,564 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-05 23:51:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:28,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:51:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:28,611 INFO L225 Difference]: With dead ends: 16749 [2020-10-05 23:51:28,611 INFO L226 Difference]: Without dead ends: 16736 [2020-10-05 23:51:28,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-05 23:51:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-05 23:51:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-05 23:51:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-05 23:51:28,915 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-05 23:51:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:28,915 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-05 23:51:28,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-05 23:51:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:28,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:28,916 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:29,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:29,117 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-10-05 23:51:29,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:29,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234042773] [2020-10-05 23:51:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:29,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234042773] [2020-10-05 23:51:29,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:29,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:29,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32992678] [2020-10-05 23:51:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:29,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:29,178 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-05 23:51:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:29,527 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-05 23:51:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:29,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:51:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:29,750 INFO L225 Difference]: With dead ends: 17085 [2020-10-05 23:51:29,751 INFO L226 Difference]: Without dead ends: 17071 [2020-10-05 23:51:29,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-05 23:51:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-05 23:51:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-05 23:51:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-05 23:51:30,027 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-05 23:51:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:30,028 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-05 23:51:30,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-05 23:51:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:51:30,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:30,028 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:30,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 23:51:30,029 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-10-05 23:51:30,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:30,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657529643] [2020-10-05 23:51:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:30,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657529643] [2020-10-05 23:51:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:30,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816545213] [2020-10-05 23:51:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:30,060 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-05 23:51:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:30,215 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-05 23:51:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:30,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:51:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:30,247 INFO L225 Difference]: With dead ends: 12234 [2020-10-05 23:51:30,247 INFO L226 Difference]: Without dead ends: 12212 [2020-10-05 23:51:30,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-05 23:51:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-05 23:51:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-05 23:51:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-05 23:51:30,506 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-05 23:51:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:30,506 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-05 23:51:30,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-05 23:51:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:30,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:30,507 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:30,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 23:51:30,508 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-10-05 23:51:30,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:30,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996155297] [2020-10-05 23:51:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:30,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996155297] [2020-10-05 23:51:30,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755256359] [2020-10-05 23:51:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:30,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:30,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:30,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:30,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:30,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396999844] [2020-10-05 23:51:30,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:30,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:30,706 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 12 states. [2020-10-05 23:51:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:31,054 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-05 23:51:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:31,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:31,101 INFO L225 Difference]: With dead ends: 19016 [2020-10-05 23:51:31,101 INFO L226 Difference]: Without dead ends: 18998 [2020-10-05 23:51:31,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-05 23:51:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-05 23:51:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-05 23:51:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-05 23:51:31,578 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-05 23:51:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:31,578 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-05 23:51:31,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-05 23:51:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:31,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:31,580 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:31,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-05 23:51:31,795 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-10-05 23:51:31,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:31,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370453303] [2020-10-05 23:51:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:31,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370453303] [2020-10-05 23:51:31,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101583198] [2020-10-05 23:51:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:31,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:31,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:31,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:31,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:31,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800017936] [2020-10-05 23:51:31,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:31,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:31,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:31,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:31,979 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 12 states. [2020-10-05 23:51:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:32,432 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-05 23:51:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:32,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:32,514 INFO L225 Difference]: With dead ends: 19670 [2020-10-05 23:51:32,515 INFO L226 Difference]: Without dead ends: 19645 [2020-10-05 23:51:32,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-05 23:51:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-05 23:51:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-05 23:51:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-05 23:51:32,917 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-05 23:51:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:32,917 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-05 23:51:32,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-05 23:51:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:32,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:32,918 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:33,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-05 23:51:33,119 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-10-05 23:51:33,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:33,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95822848] [2020-10-05 23:51:33,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:33,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95822848] [2020-10-05 23:51:33,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:33,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:33,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122025650] [2020-10-05 23:51:33,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:33,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:33,168 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-05 23:51:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:33,629 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-05 23:51:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:33,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:51:33,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:33,682 INFO L225 Difference]: With dead ends: 19852 [2020-10-05 23:51:33,682 INFO L226 Difference]: Without dead ends: 19827 [2020-10-05 23:51:33,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-05 23:51:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-05 23:51:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-05 23:51:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-05 23:51:34,050 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-05 23:51:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:34,050 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-05 23:51:34,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-05 23:51:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:34,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:34,051 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:34,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 23:51:34,051 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-10-05 23:51:34,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:34,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57301038] [2020-10-05 23:51:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:34,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57301038] [2020-10-05 23:51:34,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:34,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:34,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999498808] [2020-10-05 23:51:34,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:34,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:34,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:34,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:34,094 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-05 23:51:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:34,467 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-05 23:51:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:34,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:51:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:34,520 INFO L225 Difference]: With dead ends: 19555 [2020-10-05 23:51:34,521 INFO L226 Difference]: Without dead ends: 19530 [2020-10-05 23:51:34,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-05 23:51:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-05 23:51:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-05 23:51:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-05 23:51:34,875 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-05 23:51:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:34,875 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-05 23:51:34,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-05 23:51:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:34,877 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:34,877 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:34,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 23:51:34,877 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-10-05 23:51:34,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:34,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964977046] [2020-10-05 23:51:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:34,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964977046] [2020-10-05 23:51:34,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193878462] [2020-10-05 23:51:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:35,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:35,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:35,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:35,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:35,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632241557] [2020-10-05 23:51:35,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:35,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:35,138 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 16 states. [2020-10-05 23:51:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:36,248 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-05 23:51:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:36,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:36,320 INFO L225 Difference]: With dead ends: 26969 [2020-10-05 23:51:36,320 INFO L226 Difference]: Without dead ends: 26957 [2020-10-05 23:51:36,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-05 23:51:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-05 23:51:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-05 23:51:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-05 23:51:36,743 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-05 23:51:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:36,743 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-05 23:51:36,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-05 23:51:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:36,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:36,745 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:36,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:36,945 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:36,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-10-05 23:51:36,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:36,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193590128] [2020-10-05 23:51:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:37,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193590128] [2020-10-05 23:51:37,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325843149] [2020-10-05 23:51:37,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:37,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:37,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:37,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:37,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:37,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:37,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:37,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372749948] [2020-10-05 23:51:37,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:37,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:37,201 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 16 states. [2020-10-05 23:51:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:38,161 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-05 23:51:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:38,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:38,238 INFO L225 Difference]: With dead ends: 26661 [2020-10-05 23:51:38,238 INFO L226 Difference]: Without dead ends: 26645 [2020-10-05 23:51:38,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-05 23:51:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-05 23:51:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-05 23:51:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-05 23:51:38,837 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-05 23:51:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:38,837 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-05 23:51:38,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-05 23:51:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:38,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:38,839 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:39,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-05 23:51:39,039 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-10-05 23:51:39,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:39,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095535265] [2020-10-05 23:51:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:39,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095535265] [2020-10-05 23:51:39,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863077164] [2020-10-05 23:51:39,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:39,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:51:39,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:39,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:39,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:39,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:39,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:39,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133404648] [2020-10-05 23:51:39,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:39,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:39,408 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 16 states. [2020-10-05 23:51:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:40,500 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-05 23:51:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:40,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:40,571 INFO L225 Difference]: With dead ends: 26686 [2020-10-05 23:51:40,571 INFO L226 Difference]: Without dead ends: 26674 [2020-10-05 23:51:40,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-05 23:51:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-05 23:51:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-05 23:51:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-05 23:51:40,977 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-05 23:51:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:40,977 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-05 23:51:40,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-05 23:51:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:40,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:40,979 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:41,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:41,194 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-10-05 23:51:41,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:41,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38013900] [2020-10-05 23:51:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:41,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38013900] [2020-10-05 23:51:41,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781158661] [2020-10-05 23:51:41,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:41,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:51:41,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:41,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:41,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:41,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:41,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:41,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923796049] [2020-10-05 23:51:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:41,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:41,498 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 16 states. [2020-10-05 23:51:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:42,632 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-05 23:51:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:42,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:51:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:42,715 INFO L225 Difference]: With dead ends: 26489 [2020-10-05 23:51:42,715 INFO L226 Difference]: Without dead ends: 26473 [2020-10-05 23:51:42,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-05 23:51:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-05 23:51:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-05 23:51:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-05 23:51:43,103 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-05 23:51:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:43,104 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-05 23:51:43,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-05 23:51:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:43,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:43,105 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:43,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-05 23:51:43,306 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-10-05 23:51:43,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:43,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432461272] [2020-10-05 23:51:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:43,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432461272] [2020-10-05 23:51:43,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:43,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:43,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955568908] [2020-10-05 23:51:43,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:43,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:43,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:43,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:43,349 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-05 23:51:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:43,505 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-05 23:51:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:43,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:51:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:43,539 INFO L225 Difference]: With dead ends: 13251 [2020-10-05 23:51:43,539 INFO L226 Difference]: Without dead ends: 13220 [2020-10-05 23:51:43,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-05 23:51:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-05 23:51:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-05 23:51:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-05 23:51:43,822 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-05 23:51:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:43,822 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-05 23:51:43,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-05 23:51:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:43,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:43,823 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:43,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-05 23:51:43,824 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-10-05 23:51:43,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:43,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192829261] [2020-10-05 23:51:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:43,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192829261] [2020-10-05 23:51:43,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:43,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:43,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398627157] [2020-10-05 23:51:43,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:43,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:43,898 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-05 23:51:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:44,880 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-05 23:51:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:44,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:51:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:44,955 INFO L225 Difference]: With dead ends: 29788 [2020-10-05 23:51:44,956 INFO L226 Difference]: Without dead ends: 29770 [2020-10-05 23:51:44,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-05 23:51:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-05 23:51:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-05 23:51:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-05 23:51:45,404 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-05 23:51:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:45,404 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-05 23:51:45,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-05 23:51:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:51:45,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:45,406 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:45,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-05 23:51:45,406 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-10-05 23:51:45,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:45,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336667104] [2020-10-05 23:51:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:45,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336667104] [2020-10-05 23:51:45,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:45,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:45,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439701551] [2020-10-05 23:51:45,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:45,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:45,469 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-05 23:51:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:46,369 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-05 23:51:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:46,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:51:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:46,442 INFO L225 Difference]: With dead ends: 29379 [2020-10-05 23:51:46,443 INFO L226 Difference]: Without dead ends: 29356 [2020-10-05 23:51:46,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-05 23:51:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-05 23:51:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-05 23:51:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-05 23:51:46,915 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-05 23:51:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:46,915 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-05 23:51:46,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-05 23:51:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:46,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:46,917 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:46,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-05 23:51:46,917 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-10-05 23:51:46,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:46,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037608874] [2020-10-05 23:51:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:46,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037608874] [2020-10-05 23:51:46,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901071072] [2020-10-05 23:51:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:47,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:47,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:47,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:47,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:47,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977067367] [2020-10-05 23:51:47,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:47,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:47,127 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 12 states. [2020-10-05 23:51:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:47,573 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-05 23:51:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:47,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:51:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:47,632 INFO L225 Difference]: With dead ends: 19727 [2020-10-05 23:51:47,632 INFO L226 Difference]: Without dead ends: 19703 [2020-10-05 23:51:47,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-05 23:51:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-05 23:51:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-05 23:51:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-05 23:51:48,097 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-05 23:51:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:48,097 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-05 23:51:48,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-05 23:51:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:48,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:48,099 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:48,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-05 23:51:48,300 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-10-05 23:51:48,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:48,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81016280] [2020-10-05 23:51:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:48,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81016280] [2020-10-05 23:51:48,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257647613] [2020-10-05 23:51:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:48,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:48,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:48,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:48,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:48,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550611010] [2020-10-05 23:51:48,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:48,498 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 12 states. [2020-10-05 23:51:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:48,872 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-05 23:51:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:48,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:51:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:48,931 INFO L225 Difference]: With dead ends: 20694 [2020-10-05 23:51:48,931 INFO L226 Difference]: Without dead ends: 20666 [2020-10-05 23:51:48,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-05 23:51:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-05 23:51:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-05 23:51:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-05 23:51:49,330 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-05 23:51:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:49,330 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-05 23:51:49,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-05 23:51:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:49,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:49,333 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:49,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:49,534 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-10-05 23:51:49,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:49,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688466491] [2020-10-05 23:51:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:49,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688466491] [2020-10-05 23:51:49,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622711772] [2020-10-05 23:51:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:49,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:49,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:49,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:49,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:49,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361275220] [2020-10-05 23:51:49,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:49,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:49,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:49,728 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 12 states. [2020-10-05 23:51:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:50,160 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-05 23:51:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:50,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:51:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:50,218 INFO L225 Difference]: With dead ends: 21396 [2020-10-05 23:51:50,218 INFO L226 Difference]: Without dead ends: 21359 [2020-10-05 23:51:50,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-05 23:51:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-05 23:51:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-05 23:51:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-05 23:51:50,594 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-05 23:51:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:50,595 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-05 23:51:50,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-05 23:51:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:50,597 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:50,597 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:50,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-05 23:51:50,798 INFO L427 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-10-05 23:51:50,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:50,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209035834] [2020-10-05 23:51:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:50,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209035834] [2020-10-05 23:51:50,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:50,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:50,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258855060] [2020-10-05 23:51:50,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:51,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:51,000 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-05 23:51:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:51,397 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-05 23:51:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:51,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:51:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:51,460 INFO L225 Difference]: With dead ends: 21489 [2020-10-05 23:51:51,460 INFO L226 Difference]: Without dead ends: 21452 [2020-10-05 23:51:51,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-05 23:51:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-05 23:51:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-05 23:51:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-05 23:51:51,865 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-05 23:51:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:51,865 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-05 23:51:51,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-05 23:51:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:51,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:51,868 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:51,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-05 23:51:51,868 INFO L427 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-10-05 23:51:51,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:51,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246271825] [2020-10-05 23:51:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:51,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246271825] [2020-10-05 23:51:51,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:51,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:51,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306760606] [2020-10-05 23:51:51,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:51,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:51,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:51,920 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-05 23:51:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:52,329 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-10-05 23:51:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:52,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:51:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:52,394 INFO L225 Difference]: With dead ends: 21198 [2020-10-05 23:51:52,395 INFO L226 Difference]: Without dead ends: 21161 [2020-10-05 23:51:52,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-10-05 23:51:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-10-05 23:51:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-05 23:51:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-05 23:51:52,777 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-05 23:51:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:52,777 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-05 23:51:52,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-05 23:51:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:51:52,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:52,779 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:52,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-05 23:51:52,779 INFO L427 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-10-05 23:51:52,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:52,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328607222] [2020-10-05 23:51:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:52,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328607222] [2020-10-05 23:51:52,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:52,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:52,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297002482] [2020-10-05 23:51:52,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:52,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:52,844 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-05 23:51:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:53,267 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-10-05 23:51:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:53,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:51:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:53,345 INFO L225 Difference]: With dead ends: 21067 [2020-10-05 23:51:53,345 INFO L226 Difference]: Without dead ends: 21030 [2020-10-05 23:51:53,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:51:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-10-05 23:51:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-10-05 23:51:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-05 23:51:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-05 23:51:53,727 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-05 23:51:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:53,727 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-05 23:51:53,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-05 23:51:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:53,730 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:53,730 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:53,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-05 23:51:53,730 INFO L427 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-10-05 23:51:53,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:53,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611210122] [2020-10-05 23:51:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:53,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611210122] [2020-10-05 23:51:53,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919010638] [2020-10-05 23:51:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:53,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:53,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:53,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:53,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:53,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586797312] [2020-10-05 23:51:53,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:53,988 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 16 states. [2020-10-05 23:51:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:55,175 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-05 23:51:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:55,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:55,249 INFO L225 Difference]: With dead ends: 30145 [2020-10-05 23:51:55,250 INFO L226 Difference]: Without dead ends: 30125 [2020-10-05 23:51:55,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-05 23:51:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-05 23:51:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-05 23:51:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-05 23:51:55,711 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-05 23:51:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:55,711 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-05 23:51:55,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-05 23:51:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:55,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:55,714 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:55,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-05 23:51:55,915 INFO L427 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-10-05 23:51:55,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:55,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104641995] [2020-10-05 23:51:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:55,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104641995] [2020-10-05 23:51:55,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408545078] [2020-10-05 23:51:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:56,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:56,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:56,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:56,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:56,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200833087] [2020-10-05 23:51:56,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:56,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:56,177 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 16 states. [2020-10-05 23:51:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:57,122 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-05 23:51:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:57,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:57,194 INFO L225 Difference]: With dead ends: 29696 [2020-10-05 23:51:57,194 INFO L226 Difference]: Without dead ends: 29676 [2020-10-05 23:51:57,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-05 23:51:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-05 23:51:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-05 23:51:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-05 23:51:57,642 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-05 23:51:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:57,642 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-05 23:51:57,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-05 23:51:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:57,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:57,645 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:57,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-05 23:51:57,846 INFO L427 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-10-05 23:51:57,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:57,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966070075] [2020-10-05 23:51:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:57,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966070075] [2020-10-05 23:51:57,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780242578] [2020-10-05 23:51:57,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:57,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:57,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:57,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:57,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:58,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:58,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:58,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469960273] [2020-10-05 23:51:58,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:58,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:58,098 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 16 states. [2020-10-05 23:51:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:59,133 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-05 23:51:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:59,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:59,204 INFO L225 Difference]: With dead ends: 29267 [2020-10-05 23:51:59,204 INFO L226 Difference]: Without dead ends: 29245 [2020-10-05 23:51:59,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-05 23:51:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-05 23:51:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-05 23:51:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-05 23:51:59,682 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-05 23:51:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:59,682 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-05 23:51:59,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-05 23:51:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:59,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:59,685 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:59,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-05 23:51:59,886 INFO L427 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:51:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-10-05 23:51:59,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:59,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650527903] [2020-10-05 23:51:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:59,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650527903] [2020-10-05 23:51:59,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542849036] [2020-10-05 23:51:59,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:00,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:52:00,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:00,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:00,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:00,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:00,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:00,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138223805] [2020-10-05 23:52:00,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:00,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:00,149 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 16 states. [2020-10-05 23:52:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:01,283 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-05 23:52:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:01,284 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:01,366 INFO L225 Difference]: With dead ends: 28920 [2020-10-05 23:52:01,366 INFO L226 Difference]: Without dead ends: 28898 [2020-10-05 23:52:01,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-05 23:52:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-05 23:52:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-05 23:52:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-05 23:52:01,846 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-05 23:52:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:01,847 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-05 23:52:01,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-05 23:52:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:01,850 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:01,850 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:02,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:02,051 INFO L427 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-10-05 23:52:02,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:02,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298780357] [2020-10-05 23:52:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:52:02,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298780357] [2020-10-05 23:52:02,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178235414] [2020-10-05 23:52:02,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:02,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:52:02,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:02,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:02,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:52:02,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:02,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:02,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943928951] [2020-10-05 23:52:02,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:02,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:02,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:02,305 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 16 states. [2020-10-05 23:52:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:03,300 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-05 23:52:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:03,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:03,393 INFO L225 Difference]: With dead ends: 29038 [2020-10-05 23:52:03,393 INFO L226 Difference]: Without dead ends: 29018 [2020-10-05 23:52:03,394 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-05 23:52:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-05 23:52:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-05 23:52:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-05 23:52:04,041 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-05 23:52:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:04,041 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-05 23:52:04,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-05 23:52:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:04,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:04,045 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:04,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-05 23:52:04,246 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-10-05 23:52:04,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:04,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689644838] [2020-10-05 23:52:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:52:04,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689644838] [2020-10-05 23:52:04,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604152301] [2020-10-05 23:52:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:04,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:04,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:52:04,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:04,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:04,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064981403] [2020-10-05 23:52:04,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:04,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:04,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:04,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:04,498 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 16 states. [2020-10-05 23:52:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:05,607 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-10-05 23:52:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:05,608 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:05,679 INFO L225 Difference]: With dead ends: 29417 [2020-10-05 23:52:05,679 INFO L226 Difference]: Without dead ends: 29397 [2020-10-05 23:52:05,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-10-05 23:52:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-10-05 23:52:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-10-05 23:52:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-10-05 23:52:06,122 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-10-05 23:52:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:06,122 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-10-05 23:52:06,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-10-05 23:52:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:06,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:06,126 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:06,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:06,326 INFO L427 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-10-05 23:52:06,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:06,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559981544] [2020-10-05 23:52:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:06,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559981544] [2020-10-05 23:52:06,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742894611] [2020-10-05 23:52:06,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:06,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:52:06,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:06,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:06,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:06,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:06,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:06,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304829053] [2020-10-05 23:52:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:06,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:06,615 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 16 states. [2020-10-05 23:52:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:07,892 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-10-05 23:52:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:07,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:08,008 INFO L225 Difference]: With dead ends: 29064 [2020-10-05 23:52:08,008 INFO L226 Difference]: Without dead ends: 29037 [2020-10-05 23:52:08,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-10-05 23:52:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-10-05 23:52:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-10-05 23:52:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-10-05 23:52:08,459 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-10-05 23:52:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:08,460 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-10-05 23:52:08,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-10-05 23:52:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:08,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:08,464 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:08,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-05 23:52:08,665 INFO L427 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-10-05 23:52:08,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:08,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503421474] [2020-10-05 23:52:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:08,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503421474] [2020-10-05 23:52:08,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693140863] [2020-10-05 23:52:08,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:08,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:52:08,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:08,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:08,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:09,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:09,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:09,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032192825] [2020-10-05 23:52:09,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:09,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:09,136 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 16 states. [2020-10-05 23:52:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:10,207 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-10-05 23:52:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:10,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:10,276 INFO L225 Difference]: With dead ends: 28523 [2020-10-05 23:52:10,276 INFO L226 Difference]: Without dead ends: 28501 [2020-10-05 23:52:10,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-10-05 23:52:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-10-05 23:52:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-05 23:52:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-05 23:52:10,708 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-05 23:52:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:10,708 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-05 23:52:10,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-05 23:52:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:10,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:10,712 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:10,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:10,913 INFO L427 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-10-05 23:52:10,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:10,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047289599] [2020-10-05 23:52:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:10,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047289599] [2020-10-05 23:52:10,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27911320] [2020-10-05 23:52:10,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:11,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:52:11,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:11,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:11,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:11,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:11,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:11,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160311051] [2020-10-05 23:52:11,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:11,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:11,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:11,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:11,164 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 16 states. [2020-10-05 23:52:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:12,097 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-05 23:52:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:12,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:12,171 INFO L225 Difference]: With dead ends: 28636 [2020-10-05 23:52:12,171 INFO L226 Difference]: Without dead ends: 28616 [2020-10-05 23:52:12,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-05 23:52:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-05 23:52:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-05 23:52:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-05 23:52:12,619 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-05 23:52:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:12,622 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-05 23:52:12,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-05 23:52:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:12,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:12,627 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:12,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-05 23:52:12,839 INFO L427 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-10-05 23:52:12,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:12,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435705728] [2020-10-05 23:52:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:12,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435705728] [2020-10-05 23:52:12,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647096209] [2020-10-05 23:52:12,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:12,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:52:12,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:12,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:12,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:13,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:13,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:13,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453408151] [2020-10-05 23:52:13,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:13,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:13,082 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 16 states. [2020-10-05 23:52:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:13,938 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-05 23:52:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:13,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:13,997 INFO L225 Difference]: With dead ends: 28297 [2020-10-05 23:52:13,997 INFO L226 Difference]: Without dead ends: 28277 [2020-10-05 23:52:13,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-05 23:52:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-05 23:52:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-05 23:52:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-05 23:52:14,565 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-05 23:52:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:14,565 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-05 23:52:14,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-05 23:52:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:14,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:14,568 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:14,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:14,770 INFO L427 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-10-05 23:52:14,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:14,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992974408] [2020-10-05 23:52:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:14,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992974408] [2020-10-05 23:52:14,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766554266] [2020-10-05 23:52:14,835 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:14,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:52:14,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:14,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:14,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:15,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:15,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:15,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507024451] [2020-10-05 23:52:15,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:15,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:15,012 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 16 states. [2020-10-05 23:52:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:16,064 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-05 23:52:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:16,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:16,126 INFO L225 Difference]: With dead ends: 28565 [2020-10-05 23:52:16,126 INFO L226 Difference]: Without dead ends: 28538 [2020-10-05 23:52:16,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-05 23:52:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-05 23:52:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-05 23:52:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-05 23:52:16,537 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-05 23:52:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:16,537 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-05 23:52:16,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-05 23:52:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:16,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:16,541 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:16,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-05 23:52:16,741 INFO L427 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-10-05 23:52:16,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:16,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563397800] [2020-10-05 23:52:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:16,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563397800] [2020-10-05 23:52:16,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765503619] [2020-10-05 23:52:16,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:16,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:52:16,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:16,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:16,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:52:17,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:17,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:17,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46030077] [2020-10-05 23:52:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:17,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:17,032 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 16 states. [2020-10-05 23:52:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:18,121 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-05 23:52:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:18,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:52:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:18,190 INFO L225 Difference]: With dead ends: 28213 [2020-10-05 23:52:18,191 INFO L226 Difference]: Without dead ends: 28186 [2020-10-05 23:52:18,191 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-05 23:52:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-05 23:52:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-05 23:52:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-05 23:52:18,602 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-05 23:52:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:18,602 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-05 23:52:18,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-05 23:52:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:18,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:18,605 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:18,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:18,806 INFO L427 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-10-05 23:52:18,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:18,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426624750] [2020-10-05 23:52:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:18,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426624750] [2020-10-05 23:52:18,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:18,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:18,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689156872] [2020-10-05 23:52:18,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:18,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:18,876 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-10-05 23:52:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:19,842 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-10-05 23:52:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:19,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:19,914 INFO L225 Difference]: With dead ends: 28226 [2020-10-05 23:52:19,914 INFO L226 Difference]: Without dead ends: 28206 [2020-10-05 23:52:19,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-10-05 23:52:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-10-05 23:52:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-10-05 23:52:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-10-05 23:52:20,484 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-10-05 23:52:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:20,484 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-10-05 23:52:20,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-10-05 23:52:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:20,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:20,488 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:20,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-05 23:52:20,488 INFO L427 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-10-05 23:52:20,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:20,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000700688] [2020-10-05 23:52:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:20,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000700688] [2020-10-05 23:52:20,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:20,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:20,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667183630] [2020-10-05 23:52:20,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:20,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:20,578 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-10-05 23:52:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:21,497 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-10-05 23:52:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:21,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:21,568 INFO L225 Difference]: With dead ends: 27801 [2020-10-05 23:52:21,568 INFO L226 Difference]: Without dead ends: 27781 [2020-10-05 23:52:21,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-10-05 23:52:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-10-05 23:52:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-10-05 23:52:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-10-05 23:52:21,981 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-10-05 23:52:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:21,981 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-10-05 23:52:21,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-10-05 23:52:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:21,985 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:21,985 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:21,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-05 23:52:21,985 INFO L427 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-10-05 23:52:21,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:21,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226730994] [2020-10-05 23:52:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:22,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226730994] [2020-10-05 23:52:22,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:22,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:22,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795532465] [2020-10-05 23:52:22,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:22,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:22,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:22,063 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-10-05 23:52:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:22,968 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-10-05 23:52:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:22,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:23,036 INFO L225 Difference]: With dead ends: 27548 [2020-10-05 23:52:23,037 INFO L226 Difference]: Without dead ends: 27521 [2020-10-05 23:52:23,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-10-05 23:52:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-10-05 23:52:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-10-05 23:52:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-10-05 23:52:23,431 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-10-05 23:52:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:23,432 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-10-05 23:52:23,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-10-05 23:52:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:23,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:23,435 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:23,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-05 23:52:23,435 INFO L427 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-10-05 23:52:23,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:23,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861861130] [2020-10-05 23:52:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:23,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861861130] [2020-10-05 23:52:23,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:23,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:23,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116029044] [2020-10-05 23:52:23,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:23,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:23,510 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-10-05 23:52:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:24,405 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-10-05 23:52:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:24,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:24,472 INFO L225 Difference]: With dead ends: 27167 [2020-10-05 23:52:24,472 INFO L226 Difference]: Without dead ends: 27147 [2020-10-05 23:52:24,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-10-05 23:52:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-10-05 23:52:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-10-05 23:52:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-10-05 23:52:24,855 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-10-05 23:52:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:24,855 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-10-05 23:52:24,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-10-05 23:52:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:24,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:24,858 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:24,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-05 23:52:24,858 INFO L427 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-10-05 23:52:24,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:24,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101239679] [2020-10-05 23:52:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:24,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101239679] [2020-10-05 23:52:24,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:24,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:24,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287038851] [2020-10-05 23:52:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:24,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:24,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:24,924 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-10-05 23:52:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:25,971 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-10-05 23:52:25,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:25,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:26,032 INFO L225 Difference]: With dead ends: 26955 [2020-10-05 23:52:26,032 INFO L226 Difference]: Without dead ends: 26928 [2020-10-05 23:52:26,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-10-05 23:52:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-10-05 23:52:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-10-05 23:52:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-10-05 23:52:26,406 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-10-05 23:52:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:26,407 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-10-05 23:52:26,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-10-05 23:52:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:26,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:26,410 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:26,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-05 23:52:26,410 INFO L427 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-10-05 23:52:26,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:26,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256711306] [2020-10-05 23:52:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:26,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256711306] [2020-10-05 23:52:26,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:26,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:26,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861230942] [2020-10-05 23:52:26,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:26,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:26,486 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-10-05 23:52:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:27,480 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-10-05 23:52:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:27,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:52:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:27,550 INFO L225 Difference]: With dead ends: 26632 [2020-10-05 23:52:27,550 INFO L226 Difference]: Without dead ends: 26605 [2020-10-05 23:52:27,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-10-05 23:52:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-10-05 23:52:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-10-05 23:52:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-10-05 23:52:27,913 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-10-05 23:52:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:27,914 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-10-05 23:52:27,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-10-05 23:52:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:52:27,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:27,917 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:27,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-05 23:52:27,917 INFO L427 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-10-05 23:52:27,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:27,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936067487] [2020-10-05 23:52:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-05 23:52:27,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936067487] [2020-10-05 23:52:27,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:27,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:52:27,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209648743] [2020-10-05 23:52:27,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:52:27,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:52:27,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:52:27,949 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-10-05 23:52:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:28,103 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-10-05 23:52:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:52:28,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-05 23:52:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:28,131 INFO L225 Difference]: With dead ends: 11919 [2020-10-05 23:52:28,132 INFO L226 Difference]: Without dead ends: 11887 [2020-10-05 23:52:28,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-10-05 23:52:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-10-05 23:52:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-05 23:52:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-05 23:52:28,375 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-05 23:52:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:28,376 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-05 23:52:28,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:52:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-05 23:52:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 23:52:28,379 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:28,379 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:28,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-05 23:52:28,380 INFO L427 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-10-05 23:52:28,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:28,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200933414] [2020-10-05 23:52:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:52:28,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:52:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:52:28,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:52:28,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:52:28,398 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:52:28,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-05 23:52:28,398 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:52:28,399 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:52:28,399 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-05 23:52:28,417 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,417 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,417 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,418 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,419 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,420 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,421 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,422 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,431 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,432 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,432 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,432 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,432 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,441 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,442 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,442 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,442 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,442 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,444 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,444 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,444 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,444 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,444 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,447 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,447 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,448 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,448 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,448 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,451 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,452 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,452 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,452 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,452 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,453 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,453 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,453 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,454 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,454 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:52:28,466 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-05 23:52:28,466 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:52:28,466 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:52:28,466 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:52:28,466 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:52:28,466 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:52:28,466 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:52:28,467 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:52:28,467 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:52:28,468 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-10-05 23:52:28,468 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:52:28,486 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:52:28,486 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:52:28,487 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:52:28,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:52:28,511 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:52:28,511 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:52:28,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:52:28,519 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-10-05 23:52:28,520 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:52:30,373 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-05 23:52:30,650 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:52:30,789 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:52:30,796 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-10-05 23:52:30,796 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-10-05 23:52:30,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-05 23:52:32,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-05 23:52:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-05 23:52:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:52:32,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:32,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:52:32,371 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-10-05 23:52:32,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:32,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987688991] [2020-10-05 23:52:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:32,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987688991] [2020-10-05 23:52:32,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:32,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:52:32,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241653591] [2020-10-05 23:52:32,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:52:32,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:52:32,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:52:32,391 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-05 23:52:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:32,538 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-05 23:52:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:52:32,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:52:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:32,592 INFO L225 Difference]: With dead ends: 17885 [2020-10-05 23:52:32,592 INFO L226 Difference]: Without dead ends: 16791 [2020-10-05 23:52:32,592 INFO L675 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 [2020-10-05 23:52:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-05 23:52:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-05 23:52:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-05 23:52:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-05 23:52:33,384 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-05 23:52:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:33,385 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-05 23:52:33,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:52:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-05 23:52:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:52:33,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:33,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:33,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-05 23:52:33,385 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-10-05 23:52:33,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:33,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121339236] [2020-10-05 23:52:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:33,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121339236] [2020-10-05 23:52:33,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:33,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:52:33,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8287116] [2020-10-05 23:52:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:52:33,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:52:33,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:52:33,404 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-05 23:52:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:33,660 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-05 23:52:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:52:33,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:52:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:33,752 INFO L225 Difference]: With dead ends: 30985 [2020-10-05 23:52:33,752 INFO L226 Difference]: Without dead ends: 30977 [2020-10-05 23:52:33,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-05 23:52:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-05 23:52:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-05 23:52:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-05 23:52:34,788 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-05 23:52:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:34,788 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-05 23:52:34,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:52:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-05 23:52:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:52:34,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:34,788 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:34,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-05 23:52:34,789 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-10-05 23:52:34,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:34,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953030696] [2020-10-05 23:52:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:34,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953030696] [2020-10-05 23:52:34,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:34,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:52:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997778593] [2020-10-05 23:52:34,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:52:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:52:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:52:34,810 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-05 23:52:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:35,120 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-05 23:52:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:52:35,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:52:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:37,002 INFO L225 Difference]: With dead ends: 36296 [2020-10-05 23:52:37,003 INFO L226 Difference]: Without dead ends: 36280 [2020-10-05 23:52:37,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-05 23:52:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-05 23:52:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-05 23:52:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-05 23:52:38,144 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-05 23:52:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:38,144 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-05 23:52:38,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:52:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-05 23:52:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:52:38,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:38,145 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:38,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-05 23:52:38,145 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-10-05 23:52:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:38,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452716222] [2020-10-05 23:52:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:38,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452716222] [2020-10-05 23:52:38,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224596758] [2020-10-05 23:52:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:38,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:38,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:38,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:38,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:38,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347401848] [2020-10-05 23:52:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:38,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:38,318 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 12 states. [2020-10-05 23:52:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:38,954 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-05 23:52:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:38,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:52:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:39,121 INFO L225 Difference]: With dead ends: 56720 [2020-10-05 23:52:39,121 INFO L226 Difference]: Without dead ends: 56704 [2020-10-05 23:52:39,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-05 23:52:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-05 23:52:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-05 23:52:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-05 23:52:42,817 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-05 23:52:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:42,817 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-05 23:52:42,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-05 23:52:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:52:42,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:42,818 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:43,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-05 23:52:43,019 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-10-05 23:52:43,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:43,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514876200] [2020-10-05 23:52:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:43,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514876200] [2020-10-05 23:52:43,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:43,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:43,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149361011] [2020-10-05 23:52:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:43,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:43,055 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-05 23:52:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:43,669 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-05 23:52:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:43,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:52:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:43,841 INFO L225 Difference]: With dead ends: 58078 [2020-10-05 23:52:43,841 INFO L226 Difference]: Without dead ends: 58061 [2020-10-05 23:52:43,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:52:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-05 23:52:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-05 23:52:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-05 23:52:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-05 23:52:45,307 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-05 23:52:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:45,307 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-05 23:52:45,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-05 23:52:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:52:45,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:45,308 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:45,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-05 23:52:45,308 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-10-05 23:52:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:45,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719292190] [2020-10-05 23:52:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:45,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719292190] [2020-10-05 23:52:45,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:45,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:52:45,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080702643] [2020-10-05 23:52:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:52:45,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:52:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:52:45,330 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-05 23:52:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:45,666 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-05 23:52:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:52:45,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:52:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:45,795 INFO L225 Difference]: With dead ends: 41885 [2020-10-05 23:52:45,795 INFO L226 Difference]: Without dead ends: 41856 [2020-10-05 23:52:45,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-05 23:52:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-05 23:52:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-05 23:52:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-05 23:52:47,713 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-05 23:52:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:47,713 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-05 23:52:47,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:52:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-05 23:52:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:47,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:47,714 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:47,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-05 23:52:47,714 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-10-05 23:52:47,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:47,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862787175] [2020-10-05 23:52:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:52:47,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862787175] [2020-10-05 23:52:47,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129644520] [2020-10-05 23:52:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:47,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:47,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:52:47,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:47,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:47,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132613526] [2020-10-05 23:52:47,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:47,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:47,916 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 12 states. [2020-10-05 23:52:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:48,601 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-05 23:52:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:48,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:52:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:48,818 INFO L225 Difference]: With dead ends: 66831 [2020-10-05 23:52:48,818 INFO L226 Difference]: Without dead ends: 66807 [2020-10-05 23:52:48,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-05 23:52:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-05 23:52:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-05 23:52:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-05 23:52:50,541 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-05 23:52:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:50,542 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-05 23:52:50,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-05 23:52:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:50,548 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:50,548 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:50,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-05 23:52:50,759 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-10-05 23:52:50,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:50,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087015619] [2020-10-05 23:52:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:50,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087015619] [2020-10-05 23:52:50,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530344346] [2020-10-05 23:52:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:50,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:50,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:50,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:50,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:50,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875027951] [2020-10-05 23:52:50,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:50,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:50,917 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 12 states. [2020-10-05 23:52:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:53,240 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-05 23:52:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:53,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:52:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:53,451 INFO L225 Difference]: With dead ends: 69484 [2020-10-05 23:52:53,452 INFO L226 Difference]: Without dead ends: 69451 [2020-10-05 23:52:53,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-05 23:52:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-05 23:52:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-05 23:52:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-05 23:52:55,137 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-05 23:52:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:55,138 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-05 23:52:55,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-05 23:52:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:55,138 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:55,138 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:55,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:55,339 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-10-05 23:52:55,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:55,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397721355] [2020-10-05 23:52:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:55,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397721355] [2020-10-05 23:52:55,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:55,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:55,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785964443] [2020-10-05 23:52:55,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:55,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:55,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:55,376 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-05 23:52:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:56,003 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-05 23:52:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:56,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:52:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:56,208 INFO L225 Difference]: With dead ends: 70510 [2020-10-05 23:52:56,209 INFO L226 Difference]: Without dead ends: 70477 [2020-10-05 23:52:56,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:52:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-05 23:52:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-05 23:52:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-05 23:52:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-05 23:52:58,503 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-05 23:52:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:58,503 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-05 23:52:58,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-05 23:52:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:58,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:58,504 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:58,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-05 23:52:58,505 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:52:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-10-05 23:52:58,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:58,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790682184] [2020-10-05 23:52:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:58,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790682184] [2020-10-05 23:52:58,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:58,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:58,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905947897] [2020-10-05 23:52:58,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:58,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:58,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:58,541 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-05 23:52:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:59,140 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-05 23:52:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:59,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:52:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:59,330 INFO L225 Difference]: With dead ends: 70096 [2020-10-05 23:52:59,330 INFO L226 Difference]: Without dead ends: 70063 [2020-10-05 23:52:59,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:53:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-05 23:53:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-05 23:53:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-05 23:53:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-05 23:53:01,020 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-05 23:53:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:01,020 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-05 23:53:01,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:53:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-05 23:53:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:01,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:01,021 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:01,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-05 23:53:01,022 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-10-05 23:53:01,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:01,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299218717] [2020-10-05 23:53:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:53:03,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299218717] [2020-10-05 23:53:03,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781560157] [2020-10-05 23:53:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:03,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:53:03,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:03,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:03,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712448921] [2020-10-05 23:53:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:03,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:03,257 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 16 states. [2020-10-05 23:53:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:04,617 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-05 23:53:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:04,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:53:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:04,884 INFO L225 Difference]: With dead ends: 100731 [2020-10-05 23:53:04,884 INFO L226 Difference]: Without dead ends: 100715 [2020-10-05 23:53:04,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-05 23:53:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-05 23:53:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-05 23:53:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-05 23:53:07,501 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-05 23:53:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:07,501 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-05 23:53:07,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-05 23:53:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:07,502 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:07,502 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:07,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-10-05 23:53:07,703 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-10-05 23:53:07,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:07,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326315790] [2020-10-05 23:53:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:07,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326315790] [2020-10-05 23:53:07,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659923260] [2020-10-05 23:53:07,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:07,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:53:07,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:07,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:07,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:07,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:07,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:07,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893586324] [2020-10-05 23:53:07,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:07,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:07,943 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 16 states. [2020-10-05 23:53:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:09,280 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-05 23:53:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:09,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:53:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:09,545 INFO L225 Difference]: With dead ends: 99876 [2020-10-05 23:53:09,545 INFO L226 Difference]: Without dead ends: 99855 [2020-10-05 23:53:09,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-05 23:53:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-05 23:53:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-05 23:53:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-05 23:53:12,187 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-05 23:53:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:12,188 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-05 23:53:12,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-05 23:53:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:12,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:12,189 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:12,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:12,389 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-10-05 23:53:12,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:12,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842212942] [2020-10-05 23:53:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:12,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842212942] [2020-10-05 23:53:12,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024278975] [2020-10-05 23:53:12,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:12,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:53:12,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:12,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:12,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:12,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:12,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:12,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114819090] [2020-10-05 23:53:12,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:12,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:12,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:12,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:12,636 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 16 states. [2020-10-05 23:53:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:14,053 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-05 23:53:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:14,054 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:53:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:14,327 INFO L225 Difference]: With dead ends: 100071 [2020-10-05 23:53:14,328 INFO L226 Difference]: Without dead ends: 100055 [2020-10-05 23:53:14,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-05 23:53:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-05 23:53:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-05 23:53:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-05 23:53:16,945 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-05 23:53:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:16,945 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-05 23:53:16,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-05 23:53:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:16,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:16,946 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:17,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-10-05 23:53:17,147 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-10-05 23:53:17,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:17,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562117388] [2020-10-05 23:53:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:17,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562117388] [2020-10-05 23:53:17,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964212599] [2020-10-05 23:53:17,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:17,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:53:17,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:17,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:17,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:17,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:17,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:17,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173319294] [2020-10-05 23:53:17,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:17,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:17,392 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 16 states. [2020-10-05 23:53:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:18,635 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-05 23:53:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:18,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:53:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:18,901 INFO L225 Difference]: With dead ends: 99523 [2020-10-05 23:53:18,901 INFO L226 Difference]: Without dead ends: 99502 [2020-10-05 23:53:18,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-05 23:53:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-05 23:53:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-05 23:53:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-05 23:53:21,430 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-05 23:53:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:21,430 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-05 23:53:21,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-05 23:53:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:21,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:21,431 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:21,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-05 23:53:21,632 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-10-05 23:53:21,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:21,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655825100] [2020-10-05 23:53:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:53:21,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655825100] [2020-10-05 23:53:21,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:21,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:53:21,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699044426] [2020-10-05 23:53:21,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:53:21,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:53:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:53:21,686 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-10-05 23:53:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:22,965 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-10-05 23:53:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:22,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:53:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:23,231 INFO L225 Difference]: With dead ends: 99710 [2020-10-05 23:53:23,231 INFO L226 Difference]: Without dead ends: 99694 [2020-10-05 23:53:23,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:53:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-10-05 23:53:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-10-05 23:53:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-10-05 23:53:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-10-05 23:53:25,702 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-10-05 23:53:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:25,702 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-10-05 23:53:25,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:53:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-10-05 23:53:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:25,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:25,703 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:25,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-05 23:53:25,703 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-10-05 23:53:25,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:25,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629967322] [2020-10-05 23:53:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:53:25,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629967322] [2020-10-05 23:53:25,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:25,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:53:25,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694158936] [2020-10-05 23:53:25,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:53:25,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:53:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:53:25,759 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-10-05 23:53:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:26,992 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-10-05 23:53:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:26,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:53:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:27,255 INFO L225 Difference]: With dead ends: 98863 [2020-10-05 23:53:27,255 INFO L226 Difference]: Without dead ends: 98841 [2020-10-05 23:53:27,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:53:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-10-05 23:53:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-10-05 23:53:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-10-05 23:53:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-10-05 23:53:29,679 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-10-05 23:53:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:29,679 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-10-05 23:53:29,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:53:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-10-05 23:53:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:53:29,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:29,680 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:29,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-05 23:53:29,680 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-10-05 23:53:29,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:29,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368494142] [2020-10-05 23:53:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:53:29,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368494142] [2020-10-05 23:53:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:29,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:53:29,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933184179] [2020-10-05 23:53:29,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:53:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:53:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:53:29,702 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-10-05 23:53:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:30,025 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-10-05 23:53:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:53:30,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:53:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:30,153 INFO L225 Difference]: With dead ends: 46463 [2020-10-05 23:53:30,153 INFO L226 Difference]: Without dead ends: 46417 [2020-10-05 23:53:30,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:53:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-10-05 23:53:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-10-05 23:53:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-05 23:53:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-05 23:53:31,848 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-05 23:53:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:31,849 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-05 23:53:31,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:53:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-05 23:53:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:31,850 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:31,850 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:31,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-05 23:53:31,850 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-10-05 23:53:31,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:31,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004934911] [2020-10-05 23:53:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:31,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004934911] [2020-10-05 23:53:31,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100243108] [2020-10-05 23:53:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:31,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:53:31,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:32,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:32,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:53:32,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840639585] [2020-10-05 23:53:32,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:53:32,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:53:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:53:32,038 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 12 states. [2020-10-05 23:53:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:32,789 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-05 23:53:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:32,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:53:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:32,998 INFO L225 Difference]: With dead ends: 75380 [2020-10-05 23:53:32,998 INFO L226 Difference]: Without dead ends: 75344 [2020-10-05 23:53:32,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:53:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-05 23:53:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-05 23:53:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-05 23:53:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-05 23:53:35,273 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-05 23:53:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:35,273 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-05 23:53:35,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:53:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-05 23:53:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:35,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:35,275 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:35,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:35,476 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-10-05 23:53:35,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:35,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465145295] [2020-10-05 23:53:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:35,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465145295] [2020-10-05 23:53:35,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776280793] [2020-10-05 23:53:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:35,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:53:35,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:35,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:35,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:53:35,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935924523] [2020-10-05 23:53:35,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:53:35,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:35,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:53:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:53:35,659 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 12 states. [2020-10-05 23:53:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:36,390 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-05 23:53:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:36,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:53:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:36,618 INFO L225 Difference]: With dead ends: 79487 [2020-10-05 23:53:36,618 INFO L226 Difference]: Without dead ends: 79445 [2020-10-05 23:53:36,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:53:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-05 23:53:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-05 23:53:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-05 23:53:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-05 23:53:38,997 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-05 23:53:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:38,997 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-05 23:53:38,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:53:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-05 23:53:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:38,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:38,999 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:39,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:39,200 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-10-05 23:53:39,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:39,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628709570] [2020-10-05 23:53:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:53:39,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628709570] [2020-10-05 23:53:39,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057679527] [2020-10-05 23:53:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:39,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:53:39,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:53:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:39,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:53:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568519109] [2020-10-05 23:53:39,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:53:39,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:53:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:53:39,379 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 12 states. [2020-10-05 23:53:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:40,079 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-05 23:53:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:40,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:53:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:40,314 INFO L225 Difference]: With dead ends: 82728 [2020-10-05 23:53:40,314 INFO L226 Difference]: Without dead ends: 82673 [2020-10-05 23:53:40,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:53:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-05 23:53:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-05 23:53:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-05 23:53:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-05 23:53:42,773 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-05 23:53:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:42,773 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-05 23:53:42,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:53:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-05 23:53:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:42,775 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:42,775 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:42,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:42,976 INFO L427 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-10-05 23:53:42,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:42,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473954892] [2020-10-05 23:53:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:53:43,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473954892] [2020-10-05 23:53:43,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:43,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:53:43,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644454625] [2020-10-05 23:53:43,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:53:43,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:53:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:53:43,013 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-05 23:53:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:43,681 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-10-05 23:53:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:43,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:53:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:43,946 INFO L225 Difference]: With dead ends: 83507 [2020-10-05 23:53:43,947 INFO L226 Difference]: Without dead ends: 83452 [2020-10-05 23:53:43,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:53:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-10-05 23:53:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-10-05 23:53:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-05 23:53:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-05 23:53:46,446 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-05 23:53:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:46,446 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-05 23:53:46,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:53:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-05 23:53:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:46,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:46,448 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:46,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-05 23:53:46,449 INFO L427 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-10-05 23:53:46,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:46,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758157499] [2020-10-05 23:53:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:53:46,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758157499] [2020-10-05 23:53:46,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:53:46,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557874790] [2020-10-05 23:53:46,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:53:46,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:53:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:53:46,487 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-05 23:53:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:47,216 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-10-05 23:53:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:47,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:53:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:47,453 INFO L225 Difference]: With dead ends: 83523 [2020-10-05 23:53:47,453 INFO L226 Difference]: Without dead ends: 83468 [2020-10-05 23:53:47,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:53:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-10-05 23:53:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-10-05 23:53:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-05 23:53:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-05 23:53:49,943 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-05 23:53:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:49,943 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-05 23:53:49,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:53:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-05 23:53:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:53:49,945 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:49,945 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:49,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-05 23:53:49,945 INFO L427 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-10-05 23:53:49,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:49,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512849384] [2020-10-05 23:53:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:53:49,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512849384] [2020-10-05 23:53:49,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:53:49,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:53:49,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634758709] [2020-10-05 23:53:49,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:53:49,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:53:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:53:49,981 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-05 23:53:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:50,653 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-05 23:53:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:50,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:53:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:50,891 INFO L225 Difference]: With dead ends: 83918 [2020-10-05 23:53:50,891 INFO L226 Difference]: Without dead ends: 83863 [2020-10-05 23:53:50,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:53:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-05 23:53:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-05 23:53:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-05 23:53:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-05 23:53:53,365 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-05 23:53:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:53,365 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-05 23:53:53,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:53:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-05 23:53:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:53,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:53,368 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:53,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-05 23:53:53,368 INFO L427 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-10-05 23:53:53,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:53,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881923060] [2020-10-05 23:53:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:53,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881923060] [2020-10-05 23:53:53,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002493828] [2020-10-05 23:53:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:53,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:53,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:53,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:53,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:53,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115549227] [2020-10-05 23:53:53,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:53,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:53,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:53,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:53,618 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 16 states. [2020-10-05 23:53:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:55,234 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-05 23:53:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:55,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:55,559 INFO L225 Difference]: With dead ends: 122892 [2020-10-05 23:53:55,559 INFO L226 Difference]: Without dead ends: 122862 [2020-10-05 23:53:55,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-05 23:53:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-05 23:53:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-05 23:53:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-05 23:53:58,599 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-05 23:53:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:58,600 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-05 23:53:58,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-05 23:53:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:58,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:58,602 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:58,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-05 23:53:58,803 INFO L427 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:53:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-10-05 23:53:58,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:58,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163255330] [2020-10-05 23:53:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:58,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163255330] [2020-10-05 23:53:58,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431132774] [2020-10-05 23:53:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:58,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:58,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:59,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:59,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:59,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220370630] [2020-10-05 23:53:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:59,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:59,059 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 16 states. [2020-10-05 23:54:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:00,962 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-10-05 23:54:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:00,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:01,287 INFO L225 Difference]: With dead ends: 121590 [2020-10-05 23:54:01,288 INFO L226 Difference]: Without dead ends: 121560 [2020-10-05 23:54:01,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-10-05 23:54:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-10-05 23:54:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-10-05 23:54:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-10-05 23:54:06,737 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-10-05 23:54:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:06,737 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-10-05 23:54:06,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-10-05 23:54:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:06,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:06,740 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:06,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:06,948 INFO L427 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-10-05 23:54:06,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:06,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178203410] [2020-10-05 23:54:06,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:54:07,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178203410] [2020-10-05 23:54:07,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105626576] [2020-10-05 23:54:07,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:07,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:54:07,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:07,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:07,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:54:07,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:07,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:07,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321313924] [2020-10-05 23:54:07,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:07,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:07,193 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 16 states. [2020-10-05 23:54:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:08,661 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-10-05 23:54:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:08,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:08,977 INFO L225 Difference]: With dead ends: 120395 [2020-10-05 23:54:08,977 INFO L226 Difference]: Without dead ends: 120362 [2020-10-05 23:54:08,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-10-05 23:54:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-10-05 23:54:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-10-05 23:54:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-10-05 23:54:11,990 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-10-05 23:54:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:11,990 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-10-05 23:54:11,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-10-05 23:54:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:11,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:11,992 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:12,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-05 23:54:12,193 INFO L427 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:12,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-10-05 23:54:12,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:12,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085738191] [2020-10-05 23:54:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:54:12,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085738191] [2020-10-05 23:54:12,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130653259] [2020-10-05 23:54:12,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:12,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:54:12,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:12,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:12,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:54:12,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:12,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:12,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126918] [2020-10-05 23:54:12,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:12,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:12,429 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 16 states. [2020-10-05 23:54:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:15,964 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-10-05 23:54:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:15,965 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:16,290 INFO L225 Difference]: With dead ends: 119346 [2020-10-05 23:54:16,290 INFO L226 Difference]: Without dead ends: 119313 [2020-10-05 23:54:16,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. [2020-10-05 23:54:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119313 to 36040. [2020-10-05 23:54:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-05 23:54:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-05 23:54:19,090 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-05 23:54:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:19,090 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-05 23:54:19,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-05 23:54:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:19,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:19,093 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:19,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-10-05 23:54:19,293 INFO L427 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash 582269272, now seen corresponding path program 3 times [2020-10-05 23:54:19,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:19,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765706254] [2020-10-05 23:54:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:19,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765706254] [2020-10-05 23:54:19,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197696221] [2020-10-05 23:54:19,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:19,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:54:19,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:19,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:19,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:19,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:19,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:19,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203038585] [2020-10-05 23:54:19,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:19,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:19,541 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 16 states. [2020-10-05 23:54:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:21,177 INFO L93 Difference]: Finished difference Result 119770 states and 545635 transitions. [2020-10-05 23:54:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:21,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:21,491 INFO L225 Difference]: With dead ends: 119770 [2020-10-05 23:54:21,492 INFO L226 Difference]: Without dead ends: 119740 [2020-10-05 23:54:21,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. [2020-10-05 23:54:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 35471. [2020-10-05 23:54:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35471 states. [2020-10-05 23:54:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 189238 transitions. [2020-10-05 23:54:24,726 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 189238 transitions. Word has length 25 [2020-10-05 23:54:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:24,726 INFO L479 AbstractCegarLoop]: Abstraction has 35471 states and 189238 transitions. [2020-10-05 23:54:24,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 189238 transitions. [2020-10-05 23:54:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:24,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:24,728 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:24,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-05 23:54:24,929 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash 679178599, now seen corresponding path program 1 times [2020-10-05 23:54:24,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:24,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626008547] [2020-10-05 23:54:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:54:24,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626008547] [2020-10-05 23:54:24,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156691934] [2020-10-05 23:54:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:25,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:25,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:54:25,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:25,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:25,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671657858] [2020-10-05 23:54:25,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:25,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:25,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:25,172 INFO L87 Difference]: Start difference. First operand 35471 states and 189238 transitions. Second operand 16 states. [2020-10-05 23:54:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:26,720 INFO L93 Difference]: Finished difference Result 121131 states and 553230 transitions. [2020-10-05 23:54:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:26,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:29,747 INFO L225 Difference]: With dead ends: 121131 [2020-10-05 23:54:29,748 INFO L226 Difference]: Without dead ends: 121101 [2020-10-05 23:54:29,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121101 states. [2020-10-05 23:54:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121101 to 35374. [2020-10-05 23:54:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2020-10-05 23:54:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 188534 transitions. [2020-10-05 23:54:32,113 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 188534 transitions. Word has length 25 [2020-10-05 23:54:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:32,113 INFO L479 AbstractCegarLoop]: Abstraction has 35374 states and 188534 transitions. [2020-10-05 23:54:32,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 188534 transitions. [2020-10-05 23:54:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:32,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:32,115 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:32,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-05 23:54:32,316 INFO L427 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash -647539609, now seen corresponding path program 2 times [2020-10-05 23:54:32,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:32,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210764675] [2020-10-05 23:54:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:32,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210764675] [2020-10-05 23:54:32,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026925833] [2020-10-05 23:54:32,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:32,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:54:32,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:32,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:32,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:32,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:32,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:32,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225932951] [2020-10-05 23:54:32,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:32,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:32,932 INFO L87 Difference]: Start difference. First operand 35374 states and 188534 transitions. Second operand 16 states. [2020-10-05 23:54:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:34,466 INFO L93 Difference]: Finished difference Result 120194 states and 548412 transitions. [2020-10-05 23:54:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:34,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:34,786 INFO L225 Difference]: With dead ends: 120194 [2020-10-05 23:54:34,786 INFO L226 Difference]: Without dead ends: 120154 [2020-10-05 23:54:34,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120154 states. [2020-10-05 23:54:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120154 to 35219. [2020-10-05 23:54:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35219 states. [2020-10-05 23:54:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35219 states to 35219 states and 187630 transitions. [2020-10-05 23:54:37,840 INFO L78 Accepts]: Start accepts. Automaton has 35219 states and 187630 transitions. Word has length 25 [2020-10-05 23:54:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:37,840 INFO L479 AbstractCegarLoop]: Abstraction has 35219 states and 187630 transitions. [2020-10-05 23:54:37,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 35219 states and 187630 transitions. [2020-10-05 23:54:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:37,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:37,842 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:38,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:38,043 INFO L427 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash -647556008, now seen corresponding path program 4 times [2020-10-05 23:54:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:38,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706565483] [2020-10-05 23:54:38,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:38,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706565483] [2020-10-05 23:54:38,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312547270] [2020-10-05 23:54:38,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:38,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:54:38,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:38,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:38,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:54:38,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:38,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:38,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871451025] [2020-10-05 23:54:38,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:38,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:38,287 INFO L87 Difference]: Start difference. First operand 35219 states and 187630 transitions. Second operand 16 states. [2020-10-05 23:54:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:39,672 INFO L93 Difference]: Finished difference Result 118559 states and 539905 transitions. [2020-10-05 23:54:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:39,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:39,983 INFO L225 Difference]: With dead ends: 118559 [2020-10-05 23:54:39,984 INFO L226 Difference]: Without dead ends: 118526 [2020-10-05 23:54:39,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118526 states. [2020-10-05 23:54:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118526 to 34815. [2020-10-05 23:54:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34815 states. [2020-10-05 23:54:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34815 states to 34815 states and 185346 transitions. [2020-10-05 23:54:42,880 INFO L78 Accepts]: Start accepts. Automaton has 34815 states and 185346 transitions. Word has length 25 [2020-10-05 23:54:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:54:42,880 INFO L479 AbstractCegarLoop]: Abstraction has 34815 states and 185346 transitions. [2020-10-05 23:54:42,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:54:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34815 states and 185346 transitions. [2020-10-05 23:54:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:54:42,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:54:42,883 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:54:43,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-05 23:54:43,091 INFO L427 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:54:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:54:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1056609241, now seen corresponding path program 3 times [2020-10-05 23:54:43,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:54:43,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125018204] [2020-10-05 23:54:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:54:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:54:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:54:43,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125018204] [2020-10-05 23:54:43,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830725411] [2020-10-05 23:54:43,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:54:43,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:54:43,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:54:43,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:54:43,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:54:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:54:43,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:54:43,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:54:43,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596850581] [2020-10-05 23:54:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:54:43,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:54:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:54:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:54:43,327 INFO L87 Difference]: Start difference. First operand 34815 states and 185346 transitions. Second operand 16 states. [2020-10-05 23:54:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:54:45,151 INFO L93 Difference]: Finished difference Result 118955 states and 542533 transitions. [2020-10-05 23:54:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:54:45,152 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:54:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:54:45,478 INFO L225 Difference]: With dead ends: 118955 [2020-10-05 23:54:45,479 INFO L226 Difference]: Without dead ends: 118925 [2020-10-05 23:54:45,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:54:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118925 states. Received shutdown request... [2020-10-05 23:54:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118925 to 34363. [2020-10-05 23:54:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34363 states. [2020-10-05 23:54:50,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2020-10-05 23:54:50,959 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-05 23:54:50,965 WARN L228 ceAbstractionStarter]: Timeout [2020-10-05 23:54:50,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:54:50 BasicIcfg [2020-10-05 23:54:50,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:54:50,966 INFO L168 Benchmark]: Toolchain (without parser) took 233646.52 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,967 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.83 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 162.0 MB in the end (delta: -62.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 203.4 MB. Free memory was 161.3 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,968 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 203.4 MB. Free memory was 159.3 MB in the beginning and 158.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,968 INFO L168 Benchmark]: RCFGBuilder took 364.79 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 138.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,968 INFO L168 Benchmark]: TraceAbstraction took 232506.39 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.3 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2020-10-05 23:54:50,970 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 674.83 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 162.0 MB in the end (delta: -62.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 203.4 MB. Free memory was 161.3 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.04 ms. Allocated memory is still 203.4 MB. Free memory was 159.3 MB in the beginning and 158.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.79 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 138.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232506.39 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.3 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 61 ProgramPointsBefore, 18 ProgramPointsAfterwards, 58 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 304 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 80 ProgramPointsBefore, 31 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 472 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 99 ProgramPointsBefore, 41 ProgramPointsAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 673 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 106 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 840 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 137 ProgramPointsBefore, 61 ProgramPointsAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1058 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 156 ProgramPointsBefore, 71 ProgramPointsAfterwards, 138 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1407 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 232.0s, OverallIterations: 107, TraceHistogramMax: 6, AutomataDifference: 89.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.1s, HoareTripleCheckerStatistics: 4852 SDtfs, 25668 SDslu, 17924 SDs, 0 SdLazy, 33604 SolverSat, 2270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2904 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 2175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15209 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 100.0s AutomataMinimizationTime, 102 MinimizatonAttempts, 2339720 StatesRemovedByMinimization, 94 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 3145 NumberOfCodeBlocks, 3109 NumberOfCodeBlocksAsserted, 184 NumberOfCheckSat, 2906 ConstructedInterpolants, 0 QuantifiedInterpolants, 379604 SizeOfPredicates, 262 NumberOfNonLiveVariables, 5514 ConjunctsInSsa, 409 ConjunctsInUnsatCore, 151 InterpolantComputations, 53 PerfectInterpolantSequences, 928/1724 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown