/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:12:59,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:12:59,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:12:59,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:12:59,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:12:59,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:12:59,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:12:59,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:12:59,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:12:59,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:12:59,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:12:59,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:12:59,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:12:59,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:12:59,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:12:59,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:12:59,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:12:59,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:12:59,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:12:59,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:12:59,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:12:59,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:12:59,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:12:59,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:12:59,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:12:59,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:12:59,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:12:59,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:12:59,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:12:59,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:12:59,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:12:59,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:12:59,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:12:59,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:12:59,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:12:59,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:12:59,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:12:59,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:12:59,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:12:59,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:12:59,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:12:59,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-08-21 17:12:59,780 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:12:59,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:12:59,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:12:59,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:12:59,783 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:12:59,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:12:59,783 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:12:59,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:12:59,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:12:59,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:12:59,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:12:59,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:12:59,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:12:59,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:12:59,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:59,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:12:59,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:12:59,787 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:12:59,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 17:13:00,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:13:00,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:13:00,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:13:00,046 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:13:00,046 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:13:00,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-08-21 17:13:00,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8154ba6f/9790d3e4f1414318ae92ef83b02672d2/FLAG9eb70c1c3 [2021-08-21 17:13:00,562 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:13:00,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-08-21 17:13:00,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8154ba6f/9790d3e4f1414318ae92ef83b02672d2/FLAG9eb70c1c3 [2021-08-21 17:13:00,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8154ba6f/9790d3e4f1414318ae92ef83b02672d2 [2021-08-21 17:13:00,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:13:00,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:13:00,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:13:00,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:13:00,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:13:00,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:13:00" (1/1) ... [2021-08-21 17:13:00,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603dd6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:00, skipping insertion in model container [2021-08-21 17:13:00,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:13:00" (1/1) ... [2021-08-21 17:13:00,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:13:00,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:13:00,977 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:13:01,239 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-08-21 17:13:01,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:13:01,265 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:13:01,272 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-21 17:13:01,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-08-21 17:13:01,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:13:01,356 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:13:01,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01 WrapperNode [2021-08-21 17:13:01,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:13:01,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:13:01,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:13:01,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:13:01,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:13:01,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:13:01,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:13:01,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:13:01,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:13:01,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:13:01,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:13:01,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:13:01,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (1/1) ... [2021-08-21 17:13:01,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:13:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:13:01,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:13:01,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-21 17:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:13:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:13:01,488 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-21 17:13:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-21 17:13:01,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:13:01,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:13:01,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:13:01,490 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:13:02,131 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:13:02,131 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-08-21 17:13:02,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:13:02 BoogieIcfgContainer [2021-08-21 17:13:02,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:13:02,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:13:02,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:13:02,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:13:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:13:00" (1/3) ... [2021-08-21 17:13:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ee8138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:13:02, skipping insertion in model container [2021-08-21 17:13:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:13:01" (2/3) ... [2021-08-21 17:13:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ee8138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:13:02, skipping insertion in model container [2021-08-21 17:13:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:13:02" (3/3) ... [2021-08-21 17:13:02,137 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-08-21 17:13:02,140 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:13:02,140 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:13:02,140 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-21 17:13:02,140 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:13:02,175 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,179 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,179 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,179 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,179 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,179 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,180 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,181 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,182 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,183 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,184 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,185 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,192 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,192 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,193 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,193 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,193 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,195 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,199 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,199 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,199 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,202 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,205 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,206 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,206 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:13:02,213 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-21 17:13:02,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:13:02,252 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:13:02,253 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-21 17:14:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 4220 states, 3813 states have (on average 1.5683189089955416) internal successors, (5980), 4219 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-21 17:14:09,627 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:09,627 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:09,628 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1634489351, now seen corresponding path program 1 times [2021-08-21 17:14:09,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:09,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715229539] [2021-08-21 17:14:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:09,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:10,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:10,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715229539] [2021-08-21 17:14:10,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715229539] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:10,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:10,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:14:10,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612229411] [2021-08-21 17:14:10,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:14:10,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:10,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:14:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:14:10,241 INFO L87 Difference]: Start difference. First operand has 4220 states, 3813 states have (on average 1.5683189089955416) internal successors, (5980), 4219 states have internal predecessors, (5980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:10,464 INFO L93 Difference]: Finished difference Result 4014 states and 5605 transitions. [2021-08-21 17:14:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:14:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-21 17:14:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:10,481 INFO L225 Difference]: With dead ends: 4014 [2021-08-21 17:14:10,481 INFO L226 Difference]: Without dead ends: 1812 [2021-08-21 17:14:10,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:14:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-08-21 17:14:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1811. [2021-08-21 17:14:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1786 states have (on average 1.5330347144456886) internal successors, (2738), 1810 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2738 transitions. [2021-08-21 17:14:10,555 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2738 transitions. Word has length 36 [2021-08-21 17:14:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:10,555 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2738 transitions. [2021-08-21 17:14:10,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2738 transitions. [2021-08-21 17:14:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-21 17:14:10,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:10,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:10,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:14:10,557 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2071666643, now seen corresponding path program 1 times [2021-08-21 17:14:10,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:10,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650826860] [2021-08-21 17:14:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:10,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:10,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:10,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650826860] [2021-08-21 17:14:10,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650826860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:10,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:10,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:14:10,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058482304] [2021-08-21 17:14:10,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:14:10,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:14:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:14:10,711 INFO L87 Difference]: Start difference. First operand 1811 states and 2738 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:10,924 INFO L93 Difference]: Finished difference Result 1813 states and 2740 transitions. [2021-08-21 17:14:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:14:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-08-21 17:14:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:10,930 INFO L225 Difference]: With dead ends: 1813 [2021-08-21 17:14:10,930 INFO L226 Difference]: Without dead ends: 1813 [2021-08-21 17:14:10,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 115.2ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-21 17:14:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2021-08-21 17:14:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2021-08-21 17:14:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1785 states have (on average 1.5327731092436976) internal successors, (2736), 1808 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2736 transitions. [2021-08-21 17:14:10,959 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2736 transitions. Word has length 42 [2021-08-21 17:14:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:10,960 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2736 transitions. [2021-08-21 17:14:10,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2736 transitions. [2021-08-21 17:14:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-21 17:14:10,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:10,962 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:10,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:14:10,963 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1744810852, now seen corresponding path program 1 times [2021-08-21 17:14:10,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:10,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505165348] [2021-08-21 17:14:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:10,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:11,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:11,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505165348] [2021-08-21 17:14:11,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505165348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:11,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:11,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:14:11,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941293020] [2021-08-21 17:14:11,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:14:11,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:11,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:14:11,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:14:11,100 INFO L87 Difference]: Start difference. First operand 1809 states and 2736 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:11,456 INFO L93 Difference]: Finished difference Result 2932 states and 4696 transitions. [2021-08-21 17:14:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:14:11,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-21 17:14:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:11,471 INFO L225 Difference]: With dead ends: 2932 [2021-08-21 17:14:11,471 INFO L226 Difference]: Without dead ends: 2932 [2021-08-21 17:14:11,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 136.4ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:14:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2021-08-21 17:14:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2043. [2021-08-21 17:14:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 2020 states have (on average 1.5881188118811882) internal successors, (3208), 2042 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 3208 transitions. [2021-08-21 17:14:11,512 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 3208 transitions. Word has length 60 [2021-08-21 17:14:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:11,514 INFO L470 AbstractCegarLoop]: Abstraction has 2043 states and 3208 transitions. [2021-08-21 17:14:11,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 3208 transitions. [2021-08-21 17:14:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-21 17:14:11,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:11,518 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:11,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:14:11,518 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash -478651348, now seen corresponding path program 1 times [2021-08-21 17:14:11,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:11,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161791606] [2021-08-21 17:14:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:11,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:11,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:11,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161791606] [2021-08-21 17:14:11,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161791606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:11,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:11,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:14:11,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55950487] [2021-08-21 17:14:11,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:14:11,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:14:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:14:11,596 INFO L87 Difference]: Start difference. First operand 2043 states and 3208 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:11,789 INFO L93 Difference]: Finished difference Result 3166 states and 5135 transitions. [2021-08-21 17:14:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:14:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-21 17:14:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:11,797 INFO L225 Difference]: With dead ends: 3166 [2021-08-21 17:14:11,797 INFO L226 Difference]: Without dead ends: 2547 [2021-08-21 17:14:11,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:14:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2021-08-21 17:14:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2175. [2021-08-21 17:14:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2153 states have (on average 1.7315373896888062) internal successors, (3728), 2174 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3728 transitions. [2021-08-21 17:14:11,862 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3728 transitions. Word has length 66 [2021-08-21 17:14:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:11,862 INFO L470 AbstractCegarLoop]: Abstraction has 2175 states and 3728 transitions. [2021-08-21 17:14:11,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3728 transitions. [2021-08-21 17:14:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 17:14:11,865 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:11,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:11,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:14:11,865 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:11,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 724938370, now seen corresponding path program 1 times [2021-08-21 17:14:11,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:11,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043437417] [2021-08-21 17:14:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:11,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:11,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:11,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043437417] [2021-08-21 17:14:11,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043437417] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:11,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:11,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-21 17:14:11,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715649925] [2021-08-21 17:14:11,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-21 17:14:11,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-21 17:14:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-21 17:14:11,923 INFO L87 Difference]: Start difference. First operand 2175 states and 3728 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:11,947 INFO L93 Difference]: Finished difference Result 385 states and 513 transitions. [2021-08-21 17:14:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-21 17:14:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-21 17:14:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:11,949 INFO L225 Difference]: With dead ends: 385 [2021-08-21 17:14:11,949 INFO L226 Difference]: Without dead ends: 385 [2021-08-21 17:14:11,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:14:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-08-21 17:14:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2021-08-21 17:14:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 383 states have (on average 1.3394255874673628) internal successors, (513), 384 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 513 transitions. [2021-08-21 17:14:11,955 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 513 transitions. Word has length 78 [2021-08-21 17:14:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:11,956 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 513 transitions. [2021-08-21 17:14:11,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 513 transitions. [2021-08-21 17:14:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:11,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:11,957 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:11,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:14:11,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -485594629, now seen corresponding path program 1 times [2021-08-21 17:14:11,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:11,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844729946] [2021-08-21 17:14:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:11,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:12,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:12,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844729946] [2021-08-21 17:14:12,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844729946] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:12,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:12,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-21 17:14:12,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492725816] [2021-08-21 17:14:12,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-21 17:14:12,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-21 17:14:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-08-21 17:14:12,616 INFO L87 Difference]: Start difference. First operand 385 states and 513 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:13,739 INFO L93 Difference]: Finished difference Result 614 states and 884 transitions. [2021-08-21 17:14:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-21 17:14:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:13,741 INFO L225 Difference]: With dead ends: 614 [2021-08-21 17:14:13,741 INFO L226 Difference]: Without dead ends: 614 [2021-08-21 17:14:13,742 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1031.7ms TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-08-21 17:14:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 532. [2021-08-21 17:14:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 530 states have (on average 1.4188679245283018) internal successors, (752), 531 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 752 transitions. [2021-08-21 17:14:13,749 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 752 transitions. Word has length 105 [2021-08-21 17:14:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:13,750 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 752 transitions. [2021-08-21 17:14:13,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 752 transitions. [2021-08-21 17:14:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:13,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:13,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:13,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:14:13,755 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1940501163, now seen corresponding path program 2 times [2021-08-21 17:14:13,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:13,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140786136] [2021-08-21 17:14:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:13,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:14,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:14,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140786136] [2021-08-21 17:14:14,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140786136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:14,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:14,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 17:14:14,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327854286] [2021-08-21 17:14:14,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 17:14:14,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 17:14:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:14:14,123 INFO L87 Difference]: Start difference. First operand 532 states and 752 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:14,745 INFO L93 Difference]: Finished difference Result 692 states and 999 transitions. [2021-08-21 17:14:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-21 17:14:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:14,748 INFO L225 Difference]: With dead ends: 692 [2021-08-21 17:14:14,748 INFO L226 Difference]: Without dead ends: 692 [2021-08-21 17:14:14,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 474.9ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-08-21 17:14:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-08-21 17:14:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 532. [2021-08-21 17:14:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 530 states have (on average 1.4188679245283018) internal successors, (752), 531 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 752 transitions. [2021-08-21 17:14:14,756 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 752 transitions. Word has length 105 [2021-08-21 17:14:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:14,756 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 752 transitions. [2021-08-21 17:14:14,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 752 transitions. [2021-08-21 17:14:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:14,757 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:14,757 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:14,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:14:14,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2040230765, now seen corresponding path program 3 times [2021-08-21 17:14:14,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:14,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083066504] [2021-08-21 17:14:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:14,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:15,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:15,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083066504] [2021-08-21 17:14:15,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083066504] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:15,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:15,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:15,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994183353] [2021-08-21 17:14:15,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:15,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:15,265 INFO L87 Difference]: Start difference. First operand 532 states and 752 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:16,155 INFO L93 Difference]: Finished difference Result 677 states and 971 transitions. [2021-08-21 17:14:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:14:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:16,157 INFO L225 Difference]: With dead ends: 677 [2021-08-21 17:14:16,157 INFO L226 Difference]: Without dead ends: 677 [2021-08-21 17:14:16,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 780.5ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-08-21 17:14:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 532. [2021-08-21 17:14:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 530 states have (on average 1.4188679245283018) internal successors, (752), 531 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 752 transitions. [2021-08-21 17:14:16,164 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 752 transitions. Word has length 105 [2021-08-21 17:14:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:16,165 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 752 transitions. [2021-08-21 17:14:16,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 752 transitions. [2021-08-21 17:14:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:16,166 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:16,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:16,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:14:16,166 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash 267733027, now seen corresponding path program 4 times [2021-08-21 17:14:16,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:16,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593466560] [2021-08-21 17:14:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:16,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:16,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:16,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593466560] [2021-08-21 17:14:16,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593466560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:16,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:16,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 17:14:16,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540173693] [2021-08-21 17:14:16,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 17:14:16,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:16,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 17:14:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:14:16,498 INFO L87 Difference]: Start difference. First operand 532 states and 752 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:17,073 INFO L93 Difference]: Finished difference Result 650 states and 909 transitions. [2021-08-21 17:14:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-21 17:14:17,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:17,075 INFO L225 Difference]: With dead ends: 650 [2021-08-21 17:14:17,075 INFO L226 Difference]: Without dead ends: 650 [2021-08-21 17:14:17,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 485.1ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-08-21 17:14:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-08-21 17:14:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 506. [2021-08-21 17:14:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 504 states have (on average 1.4305555555555556) internal successors, (721), 505 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 721 transitions. [2021-08-21 17:14:17,082 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 721 transitions. Word has length 105 [2021-08-21 17:14:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:17,082 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 721 transitions. [2021-08-21 17:14:17,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 721 transitions. [2021-08-21 17:14:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:17,083 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:17,083 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:17,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:14:17,084 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 269820225, now seen corresponding path program 5 times [2021-08-21 17:14:17,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:17,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851740637] [2021-08-21 17:14:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:17,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:17,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:17,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851740637] [2021-08-21 17:14:17,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851740637] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:17,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:17,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:17,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625981953] [2021-08-21 17:14:17,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:17,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:17,568 INFO L87 Difference]: Start difference. First operand 506 states and 721 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:18,459 INFO L93 Difference]: Finished difference Result 745 states and 1088 transitions. [2021-08-21 17:14:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:14:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:18,462 INFO L225 Difference]: With dead ends: 745 [2021-08-21 17:14:18,462 INFO L226 Difference]: Without dead ends: 745 [2021-08-21 17:14:18,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 801.7ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-08-21 17:14:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 506. [2021-08-21 17:14:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 504 states have (on average 1.4305555555555556) internal successors, (721), 505 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 721 transitions. [2021-08-21 17:14:18,469 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 721 transitions. Word has length 105 [2021-08-21 17:14:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:18,469 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 721 transitions. [2021-08-21 17:14:18,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 721 transitions. [2021-08-21 17:14:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:18,470 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:18,470 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:18,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:14:18,471 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1223394841, now seen corresponding path program 6 times [2021-08-21 17:14:18,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:18,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545870194] [2021-08-21 17:14:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:18,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:18,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:18,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545870194] [2021-08-21 17:14:18,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545870194] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:18,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:18,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:18,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664862881] [2021-08-21 17:14:18,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:18,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:18,989 INFO L87 Difference]: Start difference. First operand 506 states and 721 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:19,787 INFO L93 Difference]: Finished difference Result 765 states and 1121 transitions. [2021-08-21 17:14:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:14:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:19,790 INFO L225 Difference]: With dead ends: 765 [2021-08-21 17:14:19,790 INFO L226 Difference]: Without dead ends: 765 [2021-08-21 17:14:19,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 740.8ms TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-08-21 17:14:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 506. [2021-08-21 17:14:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 504 states have (on average 1.4305555555555556) internal successors, (721), 505 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 721 transitions. [2021-08-21 17:14:19,797 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 721 transitions. Word has length 105 [2021-08-21 17:14:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:19,797 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 721 transitions. [2021-08-21 17:14:19,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 721 transitions. [2021-08-21 17:14:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-21 17:14:19,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:19,798 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:19,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:14:19,798 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1502409255, now seen corresponding path program 7 times [2021-08-21 17:14:19,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:19,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604373679] [2021-08-21 17:14:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:19,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:20,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:20,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604373679] [2021-08-21 17:14:20,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604373679] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:20,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:20,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:20,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882839437] [2021-08-21 17:14:20,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:20,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:20,294 INFO L87 Difference]: Start difference. First operand 506 states and 721 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:21,274 INFO L93 Difference]: Finished difference Result 620 states and 900 transitions. [2021-08-21 17:14:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:14:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-21 17:14:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:21,276 INFO L225 Difference]: With dead ends: 620 [2021-08-21 17:14:21,276 INFO L226 Difference]: Without dead ends: 620 [2021-08-21 17:14:21,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 820.7ms TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-08-21 17:14:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 383. [2021-08-21 17:14:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.337696335078534) internal successors, (511), 382 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 511 transitions. [2021-08-21 17:14:21,281 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 511 transitions. Word has length 105 [2021-08-21 17:14:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:21,281 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 511 transitions. [2021-08-21 17:14:21,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 511 transitions. [2021-08-21 17:14:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:14:21,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:21,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:21,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:14:21,283 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1405269355, now seen corresponding path program 1 times [2021-08-21 17:14:21,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:21,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530578804] [2021-08-21 17:14:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:21,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:22,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:22,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530578804] [2021-08-21 17:14:22,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530578804] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:22,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:22,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-21 17:14:22,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935784601] [2021-08-21 17:14:22,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-21 17:14:22,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:22,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-21 17:14:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-21 17:14:22,173 INFO L87 Difference]: Start difference. First operand 383 states and 511 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:24,574 INFO L93 Difference]: Finished difference Result 531 states and 717 transitions. [2021-08-21 17:14:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-21 17:14:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-21 17:14:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:24,576 INFO L225 Difference]: With dead ends: 531 [2021-08-21 17:14:24,576 INFO L226 Difference]: Without dead ends: 443 [2021-08-21 17:14:24,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2129.4ms TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2021-08-21 17:14:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-21 17:14:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 369. [2021-08-21 17:14:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.3125) internal successors, (483), 368 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 483 transitions. [2021-08-21 17:14:24,580 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 483 transitions. Word has length 111 [2021-08-21 17:14:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:24,581 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 483 transitions. [2021-08-21 17:14:24,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 483 transitions. [2021-08-21 17:14:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:14:24,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:24,582 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:24,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:14:24,582 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash -929431673, now seen corresponding path program 2 times [2021-08-21 17:14:24,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:24,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356313790] [2021-08-21 17:14:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:24,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:25,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:25,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356313790] [2021-08-21 17:14:25,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356313790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:25,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:25,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-21 17:14:25,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85385616] [2021-08-21 17:14:25,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-21 17:14:25,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-21 17:14:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-21 17:14:25,423 INFO L87 Difference]: Start difference. First operand 369 states and 483 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:28,208 INFO L93 Difference]: Finished difference Result 627 states and 846 transitions. [2021-08-21 17:14:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-21 17:14:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-21 17:14:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:28,210 INFO L225 Difference]: With dead ends: 627 [2021-08-21 17:14:28,210 INFO L226 Difference]: Without dead ends: 553 [2021-08-21 17:14:28,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2498.9ms TimeCoverageRelationStatistics Valid=511, Invalid=2351, Unknown=0, NotChecked=0, Total=2862 [2021-08-21 17:14:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-08-21 17:14:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 372. [2021-08-21 17:14:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.3126684636118597) internal successors, (487), 371 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 487 transitions. [2021-08-21 17:14:28,215 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 487 transitions. Word has length 111 [2021-08-21 17:14:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:28,215 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 487 transitions. [2021-08-21 17:14:28,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 487 transitions. [2021-08-21 17:14:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:14:28,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:28,216 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:28,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:14:28,217 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash 13812195, now seen corresponding path program 3 times [2021-08-21 17:14:28,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:28,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799529037] [2021-08-21 17:14:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:28,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:29,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:29,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799529037] [2021-08-21 17:14:29,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799529037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:29,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:29,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-21 17:14:29,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552111879] [2021-08-21 17:14:29,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-21 17:14:29,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-21 17:14:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-21 17:14:29,075 INFO L87 Difference]: Start difference. First operand 372 states and 487 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:31,787 INFO L93 Difference]: Finished difference Result 623 states and 839 transitions. [2021-08-21 17:14:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-21 17:14:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-21 17:14:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:31,790 INFO L225 Difference]: With dead ends: 623 [2021-08-21 17:14:31,790 INFO L226 Difference]: Without dead ends: 552 [2021-08-21 17:14:31,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2479.7ms TimeCoverageRelationStatistics Valid=525, Invalid=2337, Unknown=0, NotChecked=0, Total=2862 [2021-08-21 17:14:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-08-21 17:14:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 373. [2021-08-21 17:14:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3118279569892473) internal successors, (488), 372 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 488 transitions. [2021-08-21 17:14:31,795 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 488 transitions. Word has length 111 [2021-08-21 17:14:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:31,795 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 488 transitions. [2021-08-21 17:14:31,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 488 transitions. [2021-08-21 17:14:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:14:31,796 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:31,796 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:31,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:14:31,796 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2096689227, now seen corresponding path program 4 times [2021-08-21 17:14:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:31,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056900201] [2021-08-21 17:14:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:31,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:32,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:32,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056900201] [2021-08-21 17:14:32,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056900201] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:32,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:32,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-08-21 17:14:32,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94246305] [2021-08-21 17:14:32,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-21 17:14:32,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-21 17:14:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-08-21 17:14:32,715 INFO L87 Difference]: Start difference. First operand 373 states and 488 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:35,326 INFO L93 Difference]: Finished difference Result 604 states and 809 transitions. [2021-08-21 17:14:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-21 17:14:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-08-21 17:14:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:35,328 INFO L225 Difference]: With dead ends: 604 [2021-08-21 17:14:35,328 INFO L226 Difference]: Without dead ends: 534 [2021-08-21 17:14:35,329 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2432.1ms TimeCoverageRelationStatistics Valid=541, Invalid=2321, Unknown=0, NotChecked=0, Total=2862 [2021-08-21 17:14:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-08-21 17:14:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 381. [2021-08-21 17:14:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.3078947368421052) internal successors, (497), 380 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2021-08-21 17:14:35,333 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 111 [2021-08-21 17:14:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:35,334 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2021-08-21 17:14:35,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2021-08-21 17:14:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-08-21 17:14:35,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:35,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:35,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 17:14:35,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1098011091, now seen corresponding path program 5 times [2021-08-21 17:14:35,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:35,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667935944] [2021-08-21 17:14:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:35,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:14:35,417 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:14:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:14:35,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:14:35,540 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:14:35,541 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,547 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:14:35,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:14:35,548 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:14:35,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 17:14:35,566 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:14:35,566 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:14:35,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:14:35 BasicIcfg [2021-08-21 17:14:35,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:14:35,706 INFO L168 Benchmark]: Toolchain (without parser) took 94832.36 ms. Allocated memory was 163.6 MB in the beginning and 494.9 MB in the end (delta: 331.4 MB). Free memory was 145.5 MB in the beginning and 220.4 MB in the end (delta: -74.9 MB). Peak memory consumption was 256.4 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,706 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 163.6 MB. Free memory was 144.2 MB in the beginning and 144.0 MB in the end (delta: 160.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:14:35,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.29 ms. Allocated memory is still 163.6 MB. Free memory was 145.5 MB in the beginning and 104.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 41.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.74 ms. Allocated memory is still 163.6 MB. Free memory was 104.8 MB in the beginning and 101.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,707 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 163.6 MB. Free memory was 101.6 MB in the beginning and 99.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,707 INFO L168 Benchmark]: RCFGBuilder took 700.28 ms. Allocated memory is still 163.6 MB. Free memory was 99.0 MB in the beginning and 96.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,707 INFO L168 Benchmark]: TraceAbstraction took 93550.58 ms. Allocated memory was 163.6 MB in the beginning and 494.9 MB in the end (delta: 331.4 MB). Free memory was 96.4 MB in the beginning and 220.4 MB in the end (delta: -124.0 MB). Peak memory consumption was 206.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:14:35,708 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 163.6 MB. Free memory was 144.2 MB in the beginning and 144.0 MB in the end (delta: 160.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 503.29 ms. Allocated memory is still 163.6 MB. Free memory was 145.5 MB in the beginning and 104.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 41.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.74 ms. Allocated memory is still 163.6 MB. Free memory was 104.8 MB in the beginning and 101.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.09 ms. Allocated memory is still 163.6 MB. Free memory was 101.6 MB in the beginning and 99.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 700.28 ms. Allocated memory is still 163.6 MB. Free memory was 99.0 MB in the beginning and 96.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 93550.58 ms. Allocated memory was 163.6 MB in the beginning and 494.9 MB in the end (delta: 331.4 MB). Free memory was 96.4 MB in the beginning and 220.4 MB in the end (delta: -124.0 MB). Peak memory consumption was 206.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8657, positive: 8009, positive conditional: 8009, positive unconditional: 0, negative: 648, negative conditional: 648, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8505, positive: 8009, positive conditional: 0, positive unconditional: 8009, negative: 496, negative conditional: 0, negative unconditional: 496, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1042, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1042, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66982, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1549, negative conditional: 0, negative unconditional: 1549, unknown: 65434, unknown conditional: 0, unknown unconditional: 65434] ], Cache Queries: [ total: 8505, positive: 7009, positive conditional: 0, positive unconditional: 7009, negative: 454, negative conditional: 0, negative unconditional: 454, unknown: 1042, unknown conditional: 0, unknown unconditional: 1042] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 1000, Positive conditional cache size: 0, Positive unconditional cache size: 1000, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Independence queries for same thread: 152 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={7:0}, t2={8:0}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1727] 0 return 0; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1736] 0 struct my_data data; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1705] 0 data->shared.a = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1706] 0 data->shared.b = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1707] 0 data->shared.a VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1708] 0 data->shared.b VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1712] 0 my_dev = &data->dev VAL [my_dev={9:24}, t1={7:0}, t2={8:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1715] 0 return 0; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1721] 0 void *status; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 2 struct my_data *data; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] 0 \read(t1) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1740] 0 data.shared.a VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1741] 0 data.shared.b VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 93304.1ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 35.0ms, AutomataDifference: 17502.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 67361.6ms, PartialOrderReductionTime: 67335.7ms, HoareTripleCheckerStatistics: 2115 SDtfs, 8283 SDslu, 14434 SDs, 0 SdLazy, 7697 SolverSat, 926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4225.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 48 SyntacticMatches, 17 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3029 ImplicationChecksByTransitivity, 15095.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4220occurred in iteration=0, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 264.9ms AutomataMinimizationTime, 16 MinimizatonAttempts, 3119 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.3ms SsaConstructionTime, 402.0ms SatisfiabilityAnalysisTime, 7265.0ms InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1572 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1445 ConstructedInterpolants, 0 QuantifiedInterpolants, 19447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2021-08-21 17:14:35,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...