/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-1a84f73 [2021-05-01 03:17:06,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-01 03:17:06,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-01 03:17:06,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-01 03:17:06,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-01 03:17:06,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-01 03:17:06,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-01 03:17:06,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-01 03:17:06,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-01 03:17:06,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-01 03:17:06,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-01 03:17:06,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-01 03:17:06,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-01 03:17:06,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-01 03:17:06,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-01 03:17:06,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-01 03:17:06,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-01 03:17:06,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-01 03:17:06,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-01 03:17:06,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-01 03:17:06,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-01 03:17:06,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-01 03:17:06,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-01 03:17:06,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-01 03:17:06,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-01 03:17:06,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-01 03:17:06,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-01 03:17:06,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-01 03:17:06,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-01 03:17:06,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-01 03:17:06,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-01 03:17:06,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-01 03:17:06,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-01 03:17:06,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-01 03:17:06,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-01 03:17:06,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-01 03:17:06,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-01 03:17:06,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-01 03:17:06,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-01 03:17:06,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-01 03:17:06,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-01 03:17:06,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-01 03:17:06,719 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-01 03:17:06,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-01 03:17:06,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-01 03:17:06,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-01 03:17:06,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-01 03:17:06,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-01 03:17:06,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-01 03:17:06,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-01 03:17:06,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-01 03:17:06,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-01 03:17:06,723 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-01 03:17:06,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-01 03:17:06,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-01 03:17:06,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-01 03:17:06,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-01 03:17:06,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-01 03:17:06,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-01 03:17:06,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-01 03:17:06,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 03:17:06,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-01 03:17:06,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-01 03:17:06,726 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-01 03:17:06,726 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-05-01 03:17:07,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-01 03:17:07,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-01 03:17:07,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-01 03:17:07,037 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-01 03:17:07,048 INFO L275 PluginConnector]: CDTParser initialized [2021-05-01 03:17:07,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-01 03:17:07,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0128c773/0794addde95d44079bf2725215547dd2/FLAG5ce1ecb1c [2021-05-01 03:17:07,515 INFO L306 CDTParser]: Found 1 translation units. [2021-05-01 03:17:07,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-01 03:17:07,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0128c773/0794addde95d44079bf2725215547dd2/FLAG5ce1ecb1c [2021-05-01 03:17:07,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0128c773/0794addde95d44079bf2725215547dd2 [2021-05-01 03:17:07,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-01 03:17:07,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-01 03:17:07,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-01 03:17:07,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-01 03:17:07,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-01 03:17:07,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 03:17:07" (1/1) ... [2021-05-01 03:17:07,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368c1ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:07, skipping insertion in model container [2021-05-01 03:17:07,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 03:17:07" (1/1) ... [2021-05-01 03:17:07,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-01 03:17:07,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-01 03:17:08,022 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-01 03:17:08,025 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-01 03:17:08,027 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-01 03:17:08,028 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-01 03:17:08,029 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-01 03:17:08,030 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-01 03:17:08,032 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-01 03:17:08,033 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-01 03:17:08,034 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-01 03:17:08,035 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-01 03:17:08,036 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-01 03:17:08,037 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-01 03:17:08,039 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-01 03:17:08,040 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-01 03:17:08,042 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-01 03:17:08,043 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-01 03:17:08,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 03:17:08,051 INFO L203 MainTranslator]: Completed pre-run [2021-05-01 03:17:08,118 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-01 03:17:08,120 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-01 03:17:08,124 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-01 03:17:08,129 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-01 03:17:08,130 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-01 03:17:08,131 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-01 03:17:08,132 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-01 03:17:08,133 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-01 03:17:08,133 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-01 03:17:08,134 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-01 03:17:08,135 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-01 03:17:08,136 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-01 03:17:08,137 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-01 03:17:08,138 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-01 03:17:08,139 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-01 03:17:08,140 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-01 03:17:08,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 03:17:08,162 INFO L208 MainTranslator]: Completed translation [2021-05-01 03:17:08,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08 WrapperNode [2021-05-01 03:17:08,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-01 03:17:08,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-01 03:17:08,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-01 03:17:08,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-01 03:17:08,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-01 03:17:08,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-01 03:17:08,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-01 03:17:08,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-01 03:17:08,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 03:17:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-01 03:17:08,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-01 03:17:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-01 03:17:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-01 03:17:08,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-01 03:17:08,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-01 03:17:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-01 03:17:08,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-01 03:17:08,563 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-01 03:17:08,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 03:17:08 BoogieIcfgContainer [2021-05-01 03:17:08,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-01 03:17:08,565 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-01 03:17:08,565 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-01 03:17:08,566 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-01 03:17:08,568 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 03:17:08" (1/1) ... [2021-05-01 03:17:08,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 01.05 03:17:08 BasicIcfg [2021-05-01 03:17:08,588 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-01 03:17:08,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-01 03:17:08,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-01 03:17:08,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-01 03:17:08,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.05 03:17:07" (1/4) ... [2021-05-01 03:17:08,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7826f35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 03:17:08, skipping insertion in model container [2021-05-01 03:17:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 03:17:08" (2/4) ... [2021-05-01 03:17:08,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7826f35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 03:17:08, skipping insertion in model container [2021-05-01 03:17:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 03:17:08" (3/4) ... [2021-05-01 03:17:08,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7826f35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 03:17:08, skipping insertion in model container [2021-05-01 03:17:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 01.05 03:17:08" (4/4) ... [2021-05-01 03:17:08,593 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2021-05-01 03:17:08,597 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-01 03:17:08,599 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-01 03:17:08,610 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-01 03:17:08,623 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-01 03:17:08,623 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-01 03:17:08,623 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-01 03:17:08,623 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-01 03:17:08,623 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-01 03:17:08,623 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-01 03:17:08,623 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-01 03:17:08,623 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-01 03:17:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-01 03:17:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-01 03:17:08,639 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:08,640 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:08,640 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2021-05-01 03:17:08,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:08,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253044543] [2021-05-01 03:17:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:08,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:08,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:08,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:08,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:08,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:08,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:08,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:08,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:08,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:08,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:08,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:08,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:08,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253044543] [2021-05-01 03:17:08,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253044543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:08,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:08,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-01 03:17:08,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72744646] [2021-05-01 03:17:08,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-01 03:17:08,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-01 03:17:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-01 03:17:08,883 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:09,048 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-05-01 03:17:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 03:17:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-01 03:17:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:09,057 INFO L225 Difference]: With dead ends: 84 [2021-05-01 03:17:09,057 INFO L226 Difference]: Without dead ends: 76 [2021-05-01 03:17:09,058 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-01 03:17:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-01 03:17:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-01 03:17:09,091 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-01 03:17:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:09,091 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-01 03:17:09,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-01 03:17:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-01 03:17:09,092 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:09,092 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:09,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-01 03:17:09,093 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2021-05-01 03:17:09,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:09,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974192449] [2021-05-01 03:17:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,170 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-05-01 03:17:09,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:09,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:09,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:09,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:09,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974192449] [2021-05-01 03:17:09,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974192449] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:09,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:09,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:09,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269257995] [2021-05-01 03:17:09,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:09,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:09,240 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:09,417 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-01 03:17:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 03:17:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-01 03:17:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:09,422 INFO L225 Difference]: With dead ends: 75 [2021-05-01 03:17:09,423 INFO L226 Difference]: Without dead ends: 75 [2021-05-01 03:17:09,423 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-01 03:17:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2021-05-01 03:17:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-05-01 03:17:09,438 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2021-05-01 03:17:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:09,439 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-05-01 03:17:09,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-05-01 03:17:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-01 03:17:09,439 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:09,439 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:09,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-01 03:17:09,440 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2021-05-01 03:17:09,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:09,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356807230] [2021-05-01 03:17:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:09,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:09,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:09,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:09,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356807230] [2021-05-01 03:17:09,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356807230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:09,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:09,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:09,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333028749] [2021-05-01 03:17:09,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:09,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:09,546 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:09,776 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-05-01 03:17:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 03:17:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-01 03:17:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:09,777 INFO L225 Difference]: With dead ends: 97 [2021-05-01 03:17:09,777 INFO L226 Difference]: Without dead ends: 97 [2021-05-01 03:17:09,778 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 120.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 03:17:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-01 03:17:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2021-05-01 03:17:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-01 03:17:09,782 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-01 03:17:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:09,782 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-01 03:17:09,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-01 03:17:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-01 03:17:09,783 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:09,783 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:09,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-01 03:17:09,783 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2021-05-01 03:17:09,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:09,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171630810] [2021-05-01 03:17:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,806 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-05-01 03:17:09,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:09,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:09,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:09,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:09,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:09,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:09,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171630810] [2021-05-01 03:17:09,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171630810] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:09,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:09,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:09,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472936966] [2021-05-01 03:17:09,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:09,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:09,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:09,847 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:09,988 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-05-01 03:17:09,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 03:17:09,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-01 03:17:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:09,989 INFO L225 Difference]: With dead ends: 94 [2021-05-01 03:17:09,989 INFO L226 Difference]: Without dead ends: 94 [2021-05-01 03:17:09,989 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-01 03:17:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-01 03:17:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-01 03:17:09,992 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-01 03:17:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:09,992 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-01 03:17:09,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-01 03:17:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-01 03:17:09,993 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:09,993 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:09,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-01 03:17:09,993 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:09,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2021-05-01 03:17:09,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:09,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104885474] [2021-05-01 03:17:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:10,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:10,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104885474] [2021-05-01 03:17:10,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104885474] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:10,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:10,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:10,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015264554] [2021-05-01 03:17:10,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:10,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:10,052 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:10,219 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-05-01 03:17:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 03:17:10,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-01 03:17:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:10,220 INFO L225 Difference]: With dead ends: 71 [2021-05-01 03:17:10,220 INFO L226 Difference]: Without dead ends: 71 [2021-05-01 03:17:10,220 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 110.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 03:17:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-01 03:17:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2021-05-01 03:17:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-01 03:17:10,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-01 03:17:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-01 03:17:10,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-01 03:17:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-01 03:17:10,224 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:10,224 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:10,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-01 03:17:10,224 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2021-05-01 03:17:10,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:10,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001803128] [2021-05-01 03:17:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:10,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:10,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001803128] [2021-05-01 03:17:10,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001803128] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:10,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:10,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 03:17:10,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881594585] [2021-05-01 03:17:10,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 03:17:10,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 03:17:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 03:17:10,307 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:10,521 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-05-01 03:17:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 03:17:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-01 03:17:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:10,522 INFO L225 Difference]: With dead ends: 89 [2021-05-01 03:17:10,522 INFO L226 Difference]: Without dead ends: 89 [2021-05-01 03:17:10,523 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 118.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-01 03:17:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-01 03:17:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2021-05-01 03:17:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-01 03:17:10,526 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-01 03:17:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:10,526 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-01 03:17:10,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-01 03:17:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-01 03:17:10,526 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:10,527 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:10,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-01 03:17:10,527 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2021-05-01 03:17:10,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:10,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290921590] [2021-05-01 03:17:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,558 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 03:17:10,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 03:17:10,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:10,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:10,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:10,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290921590] [2021-05-01 03:17:10,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290921590] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:10,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:10,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 03:17:10,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684474602] [2021-05-01 03:17:10,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 03:17:10,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 03:17:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 03:17:10,601 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:10,785 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-05-01 03:17:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 03:17:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-01 03:17:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:10,786 INFO L225 Difference]: With dead ends: 77 [2021-05-01 03:17:10,786 INFO L226 Difference]: Without dead ends: 77 [2021-05-01 03:17:10,786 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 139.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 03:17:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-01 03:17:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2021-05-01 03:17:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-01 03:17:10,788 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-01 03:17:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:10,789 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-01 03:17:10,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-01 03:17:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-01 03:17:10,789 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:10,789 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:10,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-01 03:17:10,789 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2021-05-01 03:17:10,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:10,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394623670] [2021-05-01 03:17:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,805 INFO L142 QuantifierPusher]: treesize reduction 9, result has 25.0 percent of original size [2021-05-01 03:17:10,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:10,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:10,833 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:10,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394623670] [2021-05-01 03:17:10,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394623670] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:10,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:10,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:10,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202300039] [2021-05-01 03:17:10,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:10,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:10,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:10,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:10,834 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:10,944 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-05-01 03:17:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 03:17:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-01 03:17:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:10,947 INFO L225 Difference]: With dead ends: 85 [2021-05-01 03:17:10,947 INFO L226 Difference]: Without dead ends: 85 [2021-05-01 03:17:10,948 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-01 03:17:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-05-01 03:17:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-01 03:17:10,951 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-01 03:17:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:10,951 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-01 03:17:10,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-01 03:17:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-01 03:17:10,951 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:10,952 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:10,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-01 03:17:10,952 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2021-05-01 03:17:10,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:10,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877164198] [2021-05-01 03:17:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:10,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:10,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:10,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:10,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:10,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:11,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:11,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877164198] [2021-05-01 03:17:11,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877164198] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:11,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:11,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 03:17:11,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695032459] [2021-05-01 03:17:11,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 03:17:11,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 03:17:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 03:17:11,009 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:11,194 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-01 03:17:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 03:17:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-01 03:17:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:11,195 INFO L225 Difference]: With dead ends: 59 [2021-05-01 03:17:11,195 INFO L226 Difference]: Without dead ends: 59 [2021-05-01 03:17:11,195 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-01 03:17:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-01 03:17:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-01 03:17:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-01 03:17:11,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-01 03:17:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:11,203 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-01 03:17:11,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-01 03:17:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-01 03:17:11,205 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:11,205 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:11,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-01 03:17:11,205 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2021-05-01 03:17:11,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:11,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271696946] [2021-05-01 03:17:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,251 INFO L142 QuantifierPusher]: treesize reduction 9, result has 25.0 percent of original size [2021-05-01 03:17:11,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:11,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:11,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:11,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:11,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271696946] [2021-05-01 03:17:11,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271696946] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:11,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:11,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:11,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408194561] [2021-05-01 03:17:11,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:11,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:11,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:11,280 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:11,360 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-01 03:17:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 03:17:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-01 03:17:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:11,361 INFO L225 Difference]: With dead ends: 59 [2021-05-01 03:17:11,361 INFO L226 Difference]: Without dead ends: 59 [2021-05-01 03:17:11,361 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-01 03:17:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-01 03:17:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-01 03:17:11,363 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-01 03:17:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:11,363 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-01 03:17:11,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-01 03:17:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-01 03:17:11,364 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:11,364 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:11,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-01 03:17:11,364 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2021-05-01 03:17:11,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:11,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393643613] [2021-05-01 03:17:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:11,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:11,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:11,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:11,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393643613] [2021-05-01 03:17:11,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393643613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:11,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:11,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 03:17:11,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821388832] [2021-05-01 03:17:11,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 03:17:11,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 03:17:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 03:17:11,419 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:11,570 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-05-01 03:17:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 03:17:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-01 03:17:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:11,571 INFO L225 Difference]: With dead ends: 67 [2021-05-01 03:17:11,571 INFO L226 Difference]: Without dead ends: 67 [2021-05-01 03:17:11,571 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 75.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 03:17:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-01 03:17:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-01 03:17:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-01 03:17:11,573 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-01 03:17:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:11,573 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-01 03:17:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-01 03:17:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-01 03:17:11,574 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:11,574 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 03:17:11,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-01 03:17:11,574 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2021-05-01 03:17:11,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:11,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857078040] [2021-05-01 03:17:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:11,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:11,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:11,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:11,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:11,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857078040] [2021-05-01 03:17:11,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857078040] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:11,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:11,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 03:17:11,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826115131] [2021-05-01 03:17:11,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 03:17:11,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 03:17:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 03:17:11,642 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:11,822 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-05-01 03:17:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 03:17:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-01 03:17:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:11,822 INFO L225 Difference]: With dead ends: 72 [2021-05-01 03:17:11,823 INFO L226 Difference]: Without dead ends: 72 [2021-05-01 03:17:11,823 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-01 03:17:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-01 03:17:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-01 03:17:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-01 03:17:11,825 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-01 03:17:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:11,825 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-01 03:17:11,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-01 03:17:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-01 03:17:11,825 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:11,825 INFO L519 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] [2021-05-01 03:17:11,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-01 03:17:11,826 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2021-05-01 03:17:11,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:11,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143151866] [2021-05-01 03:17:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:11,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:11,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:11,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:11,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:11,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:11,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:11,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:11,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143151866] [2021-05-01 03:17:11,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143151866] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:11,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:11,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 03:17:11,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466264451] [2021-05-01 03:17:11,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 03:17:11,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 03:17:11,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:11,895 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:12,129 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-01 03:17:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 03:17:12,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-01 03:17:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:12,130 INFO L225 Difference]: With dead ends: 60 [2021-05-01 03:17:12,130 INFO L226 Difference]: Without dead ends: 60 [2021-05-01 03:17:12,131 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 175.7ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-01 03:17:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-01 03:17:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-01 03:17:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-01 03:17:12,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-01 03:17:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:12,132 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-01 03:17:12,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-01 03:17:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-01 03:17:12,133 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:12,133 INFO L519 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] [2021-05-01 03:17:12,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-01 03:17:12,133 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:12,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2021-05-01 03:17:12,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:12,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353618990] [2021-05-01 03:17:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:12,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:12,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:12,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:12,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:12,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353618990] [2021-05-01 03:17:12,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353618990] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:12,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:12,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 03:17:12,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948241656] [2021-05-01 03:17:12,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 03:17:12,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 03:17:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 03:17:12,189 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:12,409 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2021-05-01 03:17:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 03:17:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-01 03:17:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:12,410 INFO L225 Difference]: With dead ends: 85 [2021-05-01 03:17:12,411 INFO L226 Difference]: Without dead ends: 85 [2021-05-01 03:17:12,411 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 104.3ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-01 03:17:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-01 03:17:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-01 03:17:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-01 03:17:12,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-01 03:17:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-01 03:17:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-01 03:17:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-01 03:17:12,413 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:12,413 INFO L519 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] [2021-05-01 03:17:12,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-01 03:17:12,413 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2021-05-01 03:17:12,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:12,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071964601] [2021-05-01 03:17:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:12,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:12,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 03:17:12,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:12,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:12,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:12,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071964601] [2021-05-01 03:17:12,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071964601] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:12,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:12,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 03:17:12,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251935578] [2021-05-01 03:17:12,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 03:17:12,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 03:17:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:12,472 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:12,712 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-05-01 03:17:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 03:17:12,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-01 03:17:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:12,713 INFO L225 Difference]: With dead ends: 58 [2021-05-01 03:17:12,713 INFO L226 Difference]: Without dead ends: 58 [2021-05-01 03:17:12,713 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 163.7ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-01 03:17:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-01 03:17:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-01 03:17:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-01 03:17:12,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-01 03:17:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:12,715 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-01 03:17:12,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-01 03:17:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-01 03:17:12,716 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 03:17:12,716 INFO L519 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] [2021-05-01 03:17:12,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-01 03:17:12,716 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 03:17:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 03:17:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2021-05-01 03:17:12,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-01 03:17:12,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988482157] [2021-05-01 03:17:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 03:17:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:12,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:12,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 03:17:12,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 03:17:12,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 03:17:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 03:17:12,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 03:17:12,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 03:17:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 03:17:12,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-01 03:17:12,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988482157] [2021-05-01 03:17:12,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988482157] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 03:17:12,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 03:17:12,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 03:17:12,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028947217] [2021-05-01 03:17:12,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 03:17:12,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-01 03:17:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 03:17:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 03:17:12,776 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 03:17:13,118 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2021-05-01 03:17:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 03:17:13,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-01 03:17:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 03:17:13,119 INFO L225 Difference]: With dead ends: 123 [2021-05-01 03:17:13,119 INFO L226 Difference]: Without dead ends: 0 [2021-05-01 03:17:13,119 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 162.6ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-01 03:17:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-01 03:17:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-01 03:17:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-05-01 03:17:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-01 03:17:13,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-01 03:17:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 03:17:13,120 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-01 03:17:13,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 03:17:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-01 03:17:13,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-01 03:17:13,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-01 03:17:13,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 03:17:13 BasicIcfg [2021-05-01 03:17:13,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-01 03:17:13,124 INFO L168 Benchmark]: Toolchain (without parser) took 5235.63 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 221.4 MB in the beginning and 247.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 95.4 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,124 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-01 03:17:13,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.72 ms. Allocated memory is still 255.9 MB. Free memory was 221.2 MB in the beginning and 236.0 MB in the end (delta: -14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,125 INFO L168 Benchmark]: Boogie Preprocessor took 44.10 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,125 INFO L168 Benchmark]: RCFGBuilder took 356.58 ms. Allocated memory is still 255.9 MB. Free memory was 234.3 MB in the beginning and 210.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,125 INFO L168 Benchmark]: IcfgTransformer took 22.57 ms. Allocated memory is still 255.9 MB. Free memory was 210.8 MB in the beginning and 209.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,125 INFO L168 Benchmark]: TraceAbstraction took 4534.68 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 208.7 MB in the beginning and 247.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 84.4 MB. Max. memory is 8.0 GB. [2021-05-01 03:17:13,126 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 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 272.72 ms. Allocated memory is still 255.9 MB. Free memory was 221.2 MB in the beginning and 236.0 MB in the end (delta: -14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.10 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 356.58 ms. Allocated memory is still 255.9 MB. Free memory was 234.3 MB in the beginning and 210.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * IcfgTransformer took 22.57 ms. Allocated memory is still 255.9 MB. Free memory was 210.8 MB in the beginning and 209.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4534.68 ms. Allocated memory was 255.9 MB in the beginning and 377.5 MB in the end (delta: 121.6 MB). Free memory was 208.7 MB in the beginning and 247.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 84.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4499.3ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 14.7ms, AutomataDifference: 3074.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 931 SDtfs, 1965 SDslu, 201 SDs, 0 SdLazy, 1664 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1323.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1744.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 73.1ms AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.6ms SsaConstructionTime, 134.2ms SatisfiabilityAnalysisTime, 1029.7ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...