/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -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.2-dev-7968f31 [2022-03-17 14:57:45,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 14:57:45,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 14:57:45,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 14:57:45,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 14:57:45,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 14:57:45,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 14:57:45,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 14:57:45,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 14:57:45,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 14:57:45,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 14:57:45,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 14:57:45,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 14:57:45,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 14:57:45,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 14:57:45,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 14:57:45,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 14:57:45,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 14:57:45,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 14:57:45,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 14:57:45,676 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 14:57:45,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 14:57:45,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 14:57:45,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 14:57:45,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 14:57:45,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 14:57:45,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 14:57:45,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 14:57:45,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 14:57:45,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 14:57:45,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 14:57:45,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 14:57:45,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 14:57:45,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 14:57:45,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 14:57:45,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 14:57:45,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 14:57:45,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 14:57:45,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 14:57:45,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 14:57:45,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 14:57:45,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 14:57:45,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 14:57:45,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 14:57:45,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 14:57:45,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 14:57:45,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 14:57:45,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 14:57:45,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:57:45,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 14:57:45,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 14:57:45,709 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 14:57:45,709 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 14:57:45,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 14:57:45,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 14:57:45,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 14:57:45,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 14:57:45,923 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 14:57:45,923 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 [2022-03-17 14:57:45,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f60c6765/59922f3d431a428c9a8c8a3f1719c012/FLAGd37726c97 [2022-03-17 14:57:46,329 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 14:57:46,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-03-17 14:57:46,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f60c6765/59922f3d431a428c9a8c8a3f1719c012/FLAGd37726c97 [2022-03-17 14:57:46,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f60c6765/59922f3d431a428c9a8c8a3f1719c012 [2022-03-17 14:57:46,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 14:57:46,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 14:57:46,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 14:57:46,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 14:57:46,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 14:57:46,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211968ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46, skipping insertion in model container [2022-03-17 14:57:46,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 14:57:46,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 14:57:46,562 WARN L230 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] [2022-03-17 14:57:46,567 WARN L230 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] [2022-03-17 14:57:46,569 WARN L230 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] [2022-03-17 14:57:46,574 WARN L230 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] [2022-03-17 14:57:46,576 WARN L230 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] [2022-03-17 14:57:46,578 WARN L230 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] [2022-03-17 14:57:46,582 WARN L230 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] [2022-03-17 14:57:46,583 WARN L230 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] [2022-03-17 14:57:46,584 WARN L230 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] [2022-03-17 14:57:46,585 WARN L230 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] [2022-03-17 14:57:46,589 WARN L230 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] [2022-03-17 14:57:46,591 WARN L230 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] [2022-03-17 14:57:46,592 WARN L230 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] [2022-03-17 14:57:46,592 WARN L230 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] [2022-03-17 14:57:46,594 WARN L230 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] [2022-03-17 14:57:46,594 WARN L230 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] [2022-03-17 14:57:46,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:57:46,606 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 14:57:46,627 WARN L230 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] [2022-03-17 14:57:46,628 WARN L230 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] [2022-03-17 14:57:46,636 WARN L230 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] [2022-03-17 14:57:46,642 WARN L230 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] [2022-03-17 14:57:46,642 WARN L230 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] [2022-03-17 14:57:46,643 WARN L230 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] [2022-03-17 14:57:46,644 WARN L230 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] [2022-03-17 14:57:46,645 WARN L230 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] [2022-03-17 14:57:46,645 WARN L230 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] [2022-03-17 14:57:46,646 WARN L230 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] [2022-03-17 14:57:46,647 WARN L230 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] [2022-03-17 14:57:46,648 WARN L230 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] [2022-03-17 14:57:46,648 WARN L230 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] [2022-03-17 14:57:46,649 WARN L230 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] [2022-03-17 14:57:46,650 WARN L230 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] [2022-03-17 14:57:46,651 WARN L230 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] [2022-03-17 14:57:46,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:57:46,673 INFO L208 MainTranslator]: Completed translation [2022-03-17 14:57:46,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46 WrapperNode [2022-03-17 14:57:46,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 14:57:46,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 14:57:46,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 14:57:46,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 14:57:46,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 14:57:46,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 14:57:46,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 14:57:46,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 14:57:46,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:57:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:57:46,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 14:57:46,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 14:57:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 14:57:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 14:57:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 14:57:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 14:57:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 14:57:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 14:57:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 14:57:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 14:57:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 14:57:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 14:57:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 14:57:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 14:57:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 14:57:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 14:57:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 14:57:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 14:57:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 14:57:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 14:57:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 14:57:46,806 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 14:57:46,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 14:57:46,954 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 14:57:46,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 14:57:46,964 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-17 14:57:46,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:57:46 BoogieIcfgContainer [2022-03-17 14:57:46,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 14:57:46,965 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 14:57:46,965 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 14:57:46,978 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 14:57:46,980 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:57:46" (1/1) ... [2022-03-17 14:57:46,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:57:46 BasicIcfg [2022-03-17 14:57:46,997 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 14:57:46,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 14:57:46,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 14:57:47,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 14:57:47,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:57:46" (1/4) ... [2022-03-17 14:57:47,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b11a8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:57:47, skipping insertion in model container [2022-03-17 14:57:47,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:57:46" (2/4) ... [2022-03-17 14:57:47,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b11a8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:57:47, skipping insertion in model container [2022-03-17 14:57:47,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:57:46" (3/4) ... [2022-03-17 14:57:47,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b11a8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:57:47, skipping insertion in model container [2022-03-17 14:57:47,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:57:46" (4/4) ... [2022-03-17 14:57:47,013 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2022-03-17 14:57:47,017 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 14:57:47,017 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-03-17 14:57:47,041 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 14:57:47,044 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 14:57:47,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-03-17 14:57:47,053 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) [2022-03-17 14:57:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-17 14:57:47,057 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:47,058 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:47,058 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2022-03-17 14:57:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:47,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082049325] [2022-03-17 14:57:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:47,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082049325] [2022-03-17 14:57:47,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082049325] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:47,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:47,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 14:57:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789791704] [2022-03-17 14:57:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:47,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 14:57:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 14:57:47,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 14:57:47,231 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) [2022-03-17 14:57:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:47,326 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-03-17 14:57:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 14:57:47,328 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 [2022-03-17 14:57:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:47,334 INFO L225 Difference]: With dead ends: 84 [2022-03-17 14:57:47,334 INFO L226 Difference]: Without dead ends: 76 [2022-03-17 14:57:47,335 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:47,338 INFO L912 BasicCegarLoop]: 89 mSDtfsCounter, 117 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:47,338 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:57:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-17 14:57:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-03-17 14:57:47,358 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) [2022-03-17 14:57:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-03-17 14:57:47,360 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-03-17 14:57:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:47,360 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-03-17 14:57:47,360 INFO L479 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) [2022-03-17 14:57:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-03-17 14:57:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-17 14:57:47,361 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:47,361 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:47,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 14:57:47,361 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2022-03-17 14:57:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:47,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767866291] [2022-03-17 14:57:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767866291] [2022-03-17 14:57:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767866291] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:47,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:47,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881217762] [2022-03-17 14:57:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:47,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:47,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:47,443 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) [2022-03-17 14:57:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:47,526 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-03-17 14:57:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 14:57:47,526 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 [2022-03-17 14:57:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:47,529 INFO L225 Difference]: With dead ends: 75 [2022-03-17 14:57:47,529 INFO L226 Difference]: Without dead ends: 75 [2022-03-17 14:57:47,529 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:47,530 INFO L912 BasicCegarLoop]: 58 mSDtfsCounter, 150 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:47,531 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-17 14:57:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-03-17 14:57:47,535 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) [2022-03-17 14:57:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-03-17 14:57:47,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2022-03-17 14:57:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:47,536 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-03-17 14:57:47,536 INFO L479 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) [2022-03-17 14:57:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-03-17 14:57:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-17 14:57:47,536 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:47,536 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:47,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 14:57:47,537 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2022-03-17 14:57:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65831413] [2022-03-17 14:57:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:47,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65831413] [2022-03-17 14:57:47,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65831413] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:47,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:47,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625623829] [2022-03-17 14:57:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:47,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:47,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:47,608 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) [2022-03-17 14:57:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:47,726 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-03-17 14:57:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:57:47,726 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 [2022-03-17 14:57:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:47,729 INFO L225 Difference]: With dead ends: 97 [2022-03-17 14:57:47,729 INFO L226 Difference]: Without dead ends: 97 [2022-03-17 14:57:47,730 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-17 14:57:47,732 INFO L912 BasicCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:47,735 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 95 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-17 14:57:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-03-17 14:57:47,746 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) [2022-03-17 14:57:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-03-17 14:57:47,746 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-03-17 14:57:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:47,747 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-03-17 14:57:47,747 INFO L479 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) [2022-03-17 14:57:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-03-17 14:57:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-17 14:57:47,747 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:47,747 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:47,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 14:57:47,748 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2022-03-17 14:57:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:47,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176177134] [2022-03-17 14:57:47,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176177134] [2022-03-17 14:57:47,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176177134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:47,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:47,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309774514] [2022-03-17 14:57:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:47,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:47,788 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) [2022-03-17 14:57:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:47,867 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-03-17 14:57:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 14:57:47,868 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 [2022-03-17 14:57:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:47,868 INFO L225 Difference]: With dead ends: 94 [2022-03-17 14:57:47,868 INFO L226 Difference]: Without dead ends: 94 [2022-03-17 14:57:47,869 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:47,869 INFO L912 BasicCegarLoop]: 72 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:47,869 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 84 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-03-17 14:57:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-03-17 14:57:47,872 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) [2022-03-17 14:57:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-03-17 14:57:47,872 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-03-17 14:57:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:47,873 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-03-17 14:57:47,873 INFO L479 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) [2022-03-17 14:57:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-03-17 14:57:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 14:57:47,873 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:47,873 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:47,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-17 14:57:47,876 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2022-03-17 14:57:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:47,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969249394] [2022-03-17 14:57:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:47,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:47,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969249394] [2022-03-17 14:57:47,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969249394] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:47,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:47,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488175189] [2022-03-17 14:57:47,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:47,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:47,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:47,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:47,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:47,927 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) [2022-03-17 14:57:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,014 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-03-17 14:57:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:57:48,015 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 [2022-03-17 14:57:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,016 INFO L225 Difference]: With dead ends: 71 [2022-03-17 14:57:48,016 INFO L226 Difference]: Without dead ends: 71 [2022-03-17 14:57:48,017 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-17 14:57:48,018 INFO L912 BasicCegarLoop]: 58 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,019 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 70 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-17 14:57:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-03-17 14:57:48,022 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) [2022-03-17 14:57:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-03-17 14:57:48,023 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-03-17 14:57:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,023 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-03-17 14:57:48,023 INFO L479 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) [2022-03-17 14:57:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-03-17 14:57:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 14:57:48,023 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,023 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-17 14:57:48,024 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2022-03-17 14:57:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242272922] [2022-03-17 14:57:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242272922] [2022-03-17 14:57:48,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242272922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 14:57:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288404091] [2022-03-17 14:57:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:57:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:57:48,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 14:57:48,159 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) [2022-03-17 14:57:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,297 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-03-17 14:57:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 14:57:48,298 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 [2022-03-17 14:57:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,298 INFO L225 Difference]: With dead ends: 89 [2022-03-17 14:57:48,299 INFO L226 Difference]: Without dead ends: 89 [2022-03-17 14:57:48,299 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-03-17 14:57:48,301 INFO L912 BasicCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,302 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 93 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-17 14:57:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2022-03-17 14:57:48,305 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) [2022-03-17 14:57:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-03-17 14:57:48,307 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-03-17 14:57:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,309 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-03-17 14:57:48,309 INFO L479 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) [2022-03-17 14:57:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-03-17 14:57:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 14:57:48,309 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,309 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-17 14:57:48,310 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2022-03-17 14:57:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607437134] [2022-03-17 14:57:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607437134] [2022-03-17 14:57:48,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607437134] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 14:57:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119375362] [2022-03-17 14:57:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:57:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:57:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 14:57:48,387 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) [2022-03-17 14:57:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,493 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-03-17 14:57:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:57:48,493 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 [2022-03-17 14:57:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,494 INFO L225 Difference]: With dead ends: 77 [2022-03-17 14:57:48,494 INFO L226 Difference]: Without dead ends: 77 [2022-03-17 14:57:48,495 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-17 14:57:48,500 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,500 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 65 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-17 14:57:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-03-17 14:57:48,503 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) [2022-03-17 14:57:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-03-17 14:57:48,503 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-03-17 14:57:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,503 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-03-17 14:57:48,503 INFO L479 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) [2022-03-17 14:57:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-03-17 14:57:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 14:57:48,506 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,506 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-17 14:57:48,506 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2022-03-17 14:57:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841965293] [2022-03-17 14:57:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841965293] [2022-03-17 14:57:48,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841965293] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744004221] [2022-03-17 14:57:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:48,571 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) [2022-03-17 14:57:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,636 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-03-17 14:57:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 14:57:48,636 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 [2022-03-17 14:57:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,637 INFO L225 Difference]: With dead ends: 85 [2022-03-17 14:57:48,637 INFO L226 Difference]: Without dead ends: 85 [2022-03-17 14:57:48,637 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:48,637 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,638 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:57:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-03-17 14:57:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-03-17 14:57:48,639 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) [2022-03-17 14:57:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-03-17 14:57:48,640 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-03-17 14:57:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,640 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-03-17 14:57:48,640 INFO L479 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) [2022-03-17 14:57:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-03-17 14:57:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 14:57:48,641 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,641 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-17 14:57:48,641 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2022-03-17 14:57:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549690548] [2022-03-17 14:57:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549690548] [2022-03-17 14:57:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549690548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 14:57:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653582365] [2022-03-17 14:57:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:57:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:57:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 14:57:48,680 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) [2022-03-17 14:57:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,760 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-03-17 14:57:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 14:57:48,760 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 [2022-03-17 14:57:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,761 INFO L225 Difference]: With dead ends: 59 [2022-03-17 14:57:48,761 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 14:57:48,761 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-03-17 14:57:48,763 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,763 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 66 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:57:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 14:57:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-03-17 14:57:48,764 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) [2022-03-17 14:57:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-03-17 14:57:48,765 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-03-17 14:57:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,766 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-03-17 14:57:48,766 INFO L479 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) [2022-03-17 14:57:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-03-17 14:57:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 14:57:48,768 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,768 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-17 14:57:48,768 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2022-03-17 14:57:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109144253] [2022-03-17 14:57:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109144253] [2022-03-17 14:57:48,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109144253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294771920] [2022-03-17 14:57:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:48,809 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) [2022-03-17 14:57:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,854 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-03-17 14:57:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 14:57:48,854 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 [2022-03-17 14:57:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,855 INFO L225 Difference]: With dead ends: 59 [2022-03-17 14:57:48,855 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 14:57:48,855 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:48,855 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 94 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,855 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 57 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:57:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 14:57:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-03-17 14:57:48,857 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) [2022-03-17 14:57:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-03-17 14:57:48,857 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-03-17 14:57:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,857 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-03-17 14:57:48,857 INFO L479 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) [2022-03-17 14:57:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-03-17 14:57:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 14:57:48,858 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,858 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-17 14:57:48,858 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2022-03-17 14:57:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822045116] [2022-03-17 14:57:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822045116] [2022-03-17 14:57:48,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822045116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:48,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:48,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 14:57:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782630391] [2022-03-17 14:57:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:48,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 14:57:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:48,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 14:57:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:57:48,889 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) [2022-03-17 14:57:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:48,964 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-03-17 14:57:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:57:48,964 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 [2022-03-17 14:57:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:48,965 INFO L225 Difference]: With dead ends: 67 [2022-03-17 14:57:48,965 INFO L226 Difference]: Without dead ends: 67 [2022-03-17 14:57:48,965 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-17 14:57:48,966 INFO L912 BasicCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:48,966 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 70 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-17 14:57:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-03-17 14:57:48,971 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) [2022-03-17 14:57:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-03-17 14:57:48,971 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-03-17 14:57:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:48,971 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-03-17 14:57:48,971 INFO L479 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) [2022-03-17 14:57:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-03-17 14:57:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-17 14:57:48,972 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:48,973 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:48,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-17 14:57:48,973 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2022-03-17 14:57:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:48,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722992228] [2022-03-17 14:57:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:49,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722992228] [2022-03-17 14:57:49,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722992228] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:49,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:49,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 14:57:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082672711] [2022-03-17 14:57:49,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:49,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:57:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:57:49,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 14:57:49,020 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) [2022-03-17 14:57:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:49,124 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-03-17 14:57:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:57:49,124 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 [2022-03-17 14:57:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:49,124 INFO L225 Difference]: With dead ends: 72 [2022-03-17 14:57:49,125 INFO L226 Difference]: Without dead ends: 72 [2022-03-17 14:57:49,125 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-17 14:57:49,125 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:49,125 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 59 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-17 14:57:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-03-17 14:57:49,127 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) [2022-03-17 14:57:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-03-17 14:57:49,127 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-03-17 14:57:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:49,127 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-03-17 14:57:49,127 INFO L479 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) [2022-03-17 14:57:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-03-17 14:57:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-17 14:57:49,128 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:49,128 INFO L500 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] [2022-03-17 14:57:49,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-17 14:57:49,128 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2022-03-17 14:57:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833671872] [2022-03-17 14:57:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:49,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833671872] [2022-03-17 14:57:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833671872] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-17 14:57:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212086719] [2022-03-17 14:57:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:49,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 14:57:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 14:57:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:49,169 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) [2022-03-17 14:57:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:49,280 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-03-17 14:57:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 14:57:49,281 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 [2022-03-17 14:57:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:49,281 INFO L225 Difference]: With dead ends: 60 [2022-03-17 14:57:49,281 INFO L226 Difference]: Without dead ends: 60 [2022-03-17 14:57:49,281 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-17 14:57:49,282 INFO L912 BasicCegarLoop]: 46 mSDtfsCounter, 108 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:49,282 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-17 14:57:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-03-17 14:57:49,283 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) [2022-03-17 14:57:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-03-17 14:57:49,283 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-03-17 14:57:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:49,283 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-03-17 14:57:49,284 INFO L479 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) [2022-03-17 14:57:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-03-17 14:57:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 14:57:49,284 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:49,284 INFO L500 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] [2022-03-17 14:57:49,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-17 14:57:49,284 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2022-03-17 14:57:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:49,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881708435] [2022-03-17 14:57:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:49,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:49,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881708435] [2022-03-17 14:57:49,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881708435] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:49,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:49,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 14:57:49,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573004999] [2022-03-17 14:57:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:49,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:57:49,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:57:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 14:57:49,317 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) [2022-03-17 14:57:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:49,473 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-03-17 14:57:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 14:57:49,474 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 [2022-03-17 14:57:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:49,474 INFO L225 Difference]: With dead ends: 85 [2022-03-17 14:57:49,474 INFO L226 Difference]: Without dead ends: 85 [2022-03-17 14:57:49,474 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-17 14:57:49,475 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:49,475 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 77 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-03-17 14:57:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-03-17 14:57:49,476 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) [2022-03-17 14:57:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-03-17 14:57:49,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-03-17 14:57:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:49,477 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-03-17 14:57:49,477 INFO L479 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) [2022-03-17 14:57:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-03-17 14:57:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-17 14:57:49,477 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:49,477 INFO L500 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] [2022-03-17 14:57:49,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-17 14:57:49,477 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2022-03-17 14:57:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:49,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463878165] [2022-03-17 14:57:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463878165] [2022-03-17 14:57:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463878165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:49,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:49,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-17 14:57:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577930318] [2022-03-17 14:57:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:49,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 14:57:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:49,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 14:57:49,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:49,513 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) [2022-03-17 14:57:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:49,624 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-03-17 14:57:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 14:57:49,624 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 [2022-03-17 14:57:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:49,624 INFO L225 Difference]: With dead ends: 58 [2022-03-17 14:57:49,624 INFO L226 Difference]: Without dead ends: 58 [2022-03-17 14:57:49,625 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-17 14:57:49,625 INFO L912 BasicCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:49,625 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 63 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-17 14:57:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-03-17 14:57:49,626 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) [2022-03-17 14:57:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-03-17 14:57:49,626 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-03-17 14:57:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:49,627 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-03-17 14:57:49,627 INFO L479 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) [2022-03-17 14:57:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-03-17 14:57:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-17 14:57:49,627 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:57:49,627 INFO L500 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] [2022-03-17 14:57:49,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-17 14:57:49,627 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-17 14:57:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:57:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2022-03-17 14:57:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:57:49,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17720648] [2022-03-17 14:57:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:57:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:57:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:57:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:57:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:57:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:57:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17720648] [2022-03-17 14:57:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17720648] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:57:49,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:57:49,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-17 14:57:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563661029] [2022-03-17 14:57:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:57:49,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 14:57:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:57:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 14:57:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:57:49,666 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) [2022-03-17 14:57:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:57:49,854 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2022-03-17 14:57:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 14:57:49,854 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 [2022-03-17 14:57:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:57:49,854 INFO L225 Difference]: With dead ends: 123 [2022-03-17 14:57:49,854 INFO L226 Difference]: Without dead ends: 0 [2022-03-17 14:57:49,855 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-03-17 14:57:49,855 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 162 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:57:49,855 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 74 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:57:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-17 14:57:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-17 14:57:49,856 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) [2022-03-17 14:57:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-17 14:57:49,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-03-17 14:57:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:57:49,856 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-17 14:57:49,856 INFO L479 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) [2022-03-17 14:57:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-17 14:57:49,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-17 14:57:49,858 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-03-17 14:57:49,859 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-03-17 14:57:49,860 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-03-17 14:57:49,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-17 14:57:49,862 INFO L718 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:57:49,863 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 14:57:49,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:57:49 BasicIcfg [2022-03-17 14:57:49,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 14:57:49,865 INFO L158 Benchmark]: Toolchain (without parser) took 3511.98ms. Allocated memory was 194.0MB in the beginning and 278.9MB in the end (delta: 84.9MB). Free memory was 145.3MB in the beginning and 203.7MB in the end (delta: -58.4MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,865 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 14:57:49,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.89ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 165.6MB in the end (delta: -20.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,865 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 194.0MB. Free memory was 165.6MB in the beginning and 164.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,866 INFO L158 Benchmark]: RCFGBuilder took 252.13ms. Allocated memory is still 194.0MB. Free memory was 164.0MB in the beginning and 150.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,866 INFO L158 Benchmark]: IcfgTransformer took 31.98ms. Allocated memory is still 194.0MB. Free memory was 150.4MB in the beginning and 148.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,866 INFO L158 Benchmark]: TraceAbstraction took 2866.27ms. Allocated memory was 194.0MB in the beginning and 278.9MB in the end (delta: 84.9MB). Free memory was 148.3MB in the beginning and 203.7MB in the end (delta: -55.4MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. [2022-03-17 14:57:49,867 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.10ms. Allocated memory is still 194.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.89ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 165.6MB in the end (delta: -20.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 194.0MB. Free memory was 165.6MB in the beginning and 164.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.13ms. Allocated memory is still 194.0MB. Free memory was 164.0MB in the beginning and 150.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 31.98ms. Allocated memory is still 194.0MB. Free memory was 150.4MB in the beginning and 148.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2866.27ms. Allocated memory was 194.0MB in the beginning and 278.9MB in the end (delta: 84.9MB). Free memory was 148.3MB in the beginning and 203.7MB in the end (delta: -55.4MB). Peak memory consumption was 30.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 59]: 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: 88]: 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: 100]: 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: 112]: 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: 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: 205]: 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: 229]: 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: 257]: 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. OverallTime: 2.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1965 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1965 mSDsluCounter, 1188 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 241 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1608 IncrementalHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 947 mSDtfsCounter, 1608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 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! [2022-03-17 14:57:49,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...