/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:27:20,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:27:20,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:27:20,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:27:20,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:27:20,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:27:20,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:27:20,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:27:20,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:27:20,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:27:20,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:27:20,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:27:20,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:27:20,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:27:20,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:27:20,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:27:20,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:27:20,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:27:20,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:27:20,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:27:20,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:27:20,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:27:20,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:27:20,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:27:20,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:27:20,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:27:20,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:27:20,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:27:20,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:27:20,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:27:20,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:27:20,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:27:20,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:27:20,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:27:20,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:27:20,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:27:20,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:27:20,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:27:20,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:27:20,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:27:20,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:27:20,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:27:20,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:27:20,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:27:20,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:27:20,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:27:20,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:27:20,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:27:20,479 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:27:20,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:27:20,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:27:20,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:27:20,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:27:20,481 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:27:20,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:27:20,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:27:20,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:27:20,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:27:20,482 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:27:20,482 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-01-11 05:27:20,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:27:20,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:27:20,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:27:20,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:27:20,708 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:27:20,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2022-01-11 05:27:20,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f9d3f07/da6b4f3aff854054a29b41abadfa648c/FLAG994dc06ee [2022-01-11 05:27:21,167 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:27:21,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2022-01-11 05:27:21,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f9d3f07/da6b4f3aff854054a29b41abadfa648c/FLAG994dc06ee [2022-01-11 05:27:21,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f9d3f07/da6b4f3aff854054a29b41abadfa648c [2022-01-11 05:27:21,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:27:21,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:27:21,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:27:21,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:27:21,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:27:21,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4611f05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21, skipping insertion in model container [2022-01-11 05:27:21,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:27:21,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:27:21,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-01-11 05:27:21,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:27:21,546 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:27:21,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/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-01-11 05:27:21,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:27:21,615 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:27:21,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21 WrapperNode [2022-01-11 05:27:21,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:27:21,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:27:21,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:27:21,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:27:21,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,654 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 140 [2022-01-11 05:27:21,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:27:21,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:27:21,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:27:21,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:27:21,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:27:21,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:27:21,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:27:21,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:27:21,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (1/1) ... [2022-01-11 05:27:21,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:27:21,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:21,732 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-01-11 05:27:21,745 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-01-11 05:27:21,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:27:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:27:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:27:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:27:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:27:21,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:27:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:27:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:27:21,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:27:21,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:27:21,822 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:27:21,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:27:22,066 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:27:22,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:27:22,070 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 05:27:22,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:22 BoogieIcfgContainer [2022-01-11 05:27:22,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:27:22,072 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:27:22,072 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:27:22,073 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:27:22,076 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:22" (1/1) ... [2022-01-11 05:27:22,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:27:22 BasicIcfg [2022-01-11 05:27:22,140 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:27:22,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:27:22,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:27:22,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:27:22,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:27:21" (1/4) ... [2022-01-11 05:27:22,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cb0df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:27:22, skipping insertion in model container [2022-01-11 05:27:22,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:27:21" (2/4) ... [2022-01-11 05:27:22,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cb0df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:27:22, skipping insertion in model container [2022-01-11 05:27:22,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:27:22" (3/4) ... [2022-01-11 05:27:22,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cb0df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:27:22, skipping insertion in model container [2022-01-11 05:27:22,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:27:22" (4/4) ... [2022-01-11 05:27:22,146 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.iTransformedIcfg [2022-01-11 05:27:22,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:27:22,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:27:22,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:27:22,195 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 05:27:22,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:27:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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-01-11 05:27:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:27:22,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:22,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:22,212 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1483417192, now seen corresponding path program 1 times [2022-01-11 05:27:22,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:22,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243382059] [2022-01-11 05:27:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:22,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:27:22,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:22,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243382059] [2022-01-11 05:27:22,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243382059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:22,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:22,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:27:22,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786114060] [2022-01-11 05:27:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:22,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:27:22,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:27:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:27:22,462 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-01-11 05:27:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:22,477 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-01-11 05:27:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:27:22,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-11 05:27:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:22,487 INFO L225 Difference]: With dead ends: 59 [2022-01-11 05:27:22,487 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 05:27:22,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:27:22,493 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:22,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 05:27:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-11 05:27:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-01-11 05:27:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-11 05:27:22,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-01-11 05:27:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:22,518 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-11 05:27:22,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-01-11 05:27:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-11 05:27:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:27:22,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:22,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:22,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:27:22,519 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1536634695, now seen corresponding path program 1 times [2022-01-11 05:27:22,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:22,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995211999] [2022-01-11 05:27:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:22,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:27:22,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:22,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995211999] [2022-01-11 05:27:22,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995211999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:22,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:22,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:27:22,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880345688] [2022-01-11 05:27:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:22,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:27:22,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:27:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:27:22,614 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-01-11 05:27:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:22,647 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-01-11 05:27:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:27:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-11 05:27:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:22,648 INFO L225 Difference]: With dead ends: 45 [2022-01-11 05:27:22,648 INFO L226 Difference]: Without dead ends: 29 [2022-01-11 05:27:22,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:27:22,649 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:22,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-11 05:27:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-01-11 05:27:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-01-11 05:27:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-11 05:27:22,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2022-01-11 05:27:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:22,653 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-11 05:27:22,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-01-11 05:27:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-11 05:27:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:27:22,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:22,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:22,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:27:22,654 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:22,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -607936174, now seen corresponding path program 1 times [2022-01-11 05:27:22,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:22,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595161979] [2022-01-11 05:27:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:22,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:22,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595161979] [2022-01-11 05:27:22,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595161979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:22,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:22,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:27:22,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333227984] [2022-01-11 05:27:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:22,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:27:22,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:27:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:27:22,807 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-01-11 05:27:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:22,891 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-01-11 05:27:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:27:22,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-11 05:27:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:22,893 INFO L225 Difference]: With dead ends: 48 [2022-01-11 05:27:22,893 INFO L226 Difference]: Without dead ends: 39 [2022-01-11 05:27:22,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:27:22,898 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:22,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-11 05:27:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-01-11 05:27:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-01-11 05:27:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-11 05:27:22,910 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2022-01-11 05:27:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:22,910 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-11 05:27:22,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-01-11 05:27:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-11 05:27:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 05:27:22,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:22,911 INFO L514 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-01-11 05:27:22,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:27:22,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1871779606, now seen corresponding path program 1 times [2022-01-11 05:27:22,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:22,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377844866] [2022-01-11 05:27:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:22,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:23,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:23,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377844866] [2022-01-11 05:27:23,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377844866] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:27:23,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:27:23,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:27:23,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375840254] [2022-01-11 05:27:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:23,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:27:23,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:27:23,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:27:23,101 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-11 05:27:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:23,167 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-01-11 05:27:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:27:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-11 05:27:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:23,168 INFO L225 Difference]: With dead ends: 54 [2022-01-11 05:27:23,168 INFO L226 Difference]: Without dead ends: 40 [2022-01-11 05:27:23,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-11 05:27:23,169 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:23,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 64 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-11 05:27:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-01-11 05:27:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-01-11 05:27:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-11 05:27:23,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2022-01-11 05:27:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:23,174 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-11 05:27:23,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-11 05:27:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-11 05:27:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:27:23,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:23,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:23,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:27:23,175 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 281703296, now seen corresponding path program 1 times [2022-01-11 05:27:23,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:23,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389378386] [2022-01-11 05:27:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:23,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:23,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389378386] [2022-01-11 05:27:23,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389378386] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:23,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372477001] [2022-01-11 05:27:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:23,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:23,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:23,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:27:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:23,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-11 05:27:23,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:23,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:23,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372477001] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:23,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-11 05:27:23,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2022-01-11 05:27:23,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364685011] [2022-01-11 05:27:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:27:23,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:27:23,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:23,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:27:23,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:27:23,876 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-01-11 05:27:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:23,950 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-01-11 05:27:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:27:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:27:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:23,950 INFO L225 Difference]: With dead ends: 49 [2022-01-11 05:27:23,950 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:27:23,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-11 05:27:23,951 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 120 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:23,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 66 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:27:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:27:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-01-11 05:27:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-01-11 05:27:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-11 05:27:23,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 26 [2022-01-11 05:27:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:23,957 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-11 05:27:23,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-01-11 05:27:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-11 05:27:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:27:23,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:23,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:23,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:27:24,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:24,188 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 166697584, now seen corresponding path program 1 times [2022-01-11 05:27:24,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980356255] [2022-01-11 05:27:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:24,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:27:24,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:24,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980356255] [2022-01-11 05:27:24,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980356255] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338872266] [2022-01-11 05:27:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:24,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:24,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:24,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:24,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:27:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:24,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 100 conjunts are in the unsatisfiable core [2022-01-11 05:27:24,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:24,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:27:24,703 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:27:24,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-11 05:27:24,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:27:24,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:27:24,843 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:27:24,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-11 05:27:24,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-11 05:27:25,073 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:27:25,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-01-11 05:27:25,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:27:25,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-01-11 05:27:25,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-11 05:27:25,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-11 05:27:25,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-11 05:27:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:27:25,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:25,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 84 [2022-01-11 05:27:25,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_292) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (or (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt| 8) 18446744073709551616) (mod (+ .cse0 8) 18446744073709551616)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_293) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|)) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int|)) (not (<= 0 .cse0))))) is different from false [2022-01-11 05:27:25,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_288))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|)) (.cse0 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_289) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) v_ArrVal_292) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (not (<= 0 .cse1)) (and (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_289))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_293) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))))) (= (mod (+ .cse1 8) 18446744073709551616) (mod (+ .cse0 8) 18446744073709551616))))))) is different from false [2022-01-11 05:27:25,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:25,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 144 [2022-01-11 05:27:25,980 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:25,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 93 [2022-01-11 05:27:25,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 276 [2022-01-11 05:27:26,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 675 treesize of output 627 [2022-01-11 05:27:26,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 603 treesize of output 581 [2022-01-11 05:27:26,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 539 [2022-01-11 05:27:26,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 539 treesize of output 503 [2022-01-11 05:27:26,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 392 [2022-01-11 05:27:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-11 05:27:26,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338872266] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:27:26,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:27:26,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18, 18] total 37 [2022-01-11 05:27:26,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478012251] [2022-01-11 05:27:26,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:27:26,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-11 05:27:26,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-11 05:27:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1090, Unknown=3, NotChecked=134, Total=1332 [2022-01-11 05:27:26,456 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 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-01-11 05:27:27,970 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_288))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|)) (.cse0 (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_289) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) v_ArrVal_292) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (not (<= 0 .cse1)) (and (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_289))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_293) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))))) (= (mod (+ .cse1 8) 18446744073709551616) (mod (+ .cse0 8) 18446744073709551616)))))))) is different from false [2022-01-11 05:27:28,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) 4294967296)))) (and (<= 4294967297 .cse0) (<= .cse0 4294967297) (forall ((v_ArrVal_292 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_292) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (or (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt| 8) 18446744073709551616) (mod (+ .cse1 8) 18446744073709551616)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_293) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|)) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int|)) (not (<= 0 .cse1))))))) is different from false [2022-01-11 05:27:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:28,594 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-01-11 05:27:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-11 05:27:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:27:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:28,595 INFO L225 Difference]: With dead ends: 118 [2022-01-11 05:27:28,595 INFO L226 Difference]: Without dead ends: 107 [2022-01-11 05:27:28,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=466, Invalid=3326, Unknown=6, NotChecked=492, Total=4290 [2022-01-11 05:27:28,597 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 190 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:28,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 371 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 501 Invalid, 0 Unknown, 321 Unchecked, 0.4s Time] [2022-01-11 05:27:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-11 05:27:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 35. [2022-01-11 05:27:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-01-11 05:27:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-01-11 05:27:28,608 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 27 [2022-01-11 05:27:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:28,608 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-01-11 05:27:28,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 37 states have internal predecessors, (77), 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-01-11 05:27:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-01-11 05:27:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 05:27:28,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:28,609 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:28,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:27:28,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:27:28,827 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1252406796, now seen corresponding path program 2 times [2022-01-11 05:27:28,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:28,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341380450] [2022-01-11 05:27:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:28,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:27:29,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341380450] [2022-01-11 05:27:29,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341380450] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373872] [2022-01-11 05:27:29,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:27:29,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:29,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:29,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:27:31,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:27:31,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:27:31,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 112 conjunts are in the unsatisfiable core [2022-01-11 05:27:31,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:31,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:27:31,231 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:27:31,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-11 05:27:31,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:27:31,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:27:31,427 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:27:31,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-11 05:27:31,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-11 05:27:31,710 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:27:31,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-01-11 05:27:31,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:27:31,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-01-11 05:27:31,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:31,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2022-01-11 05:27:31,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-11 05:27:31,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:27:31,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2022-01-11 05:27:32,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-11 05:27:32,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-11 05:27:32,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-11 05:27:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:27:32,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:32,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:32,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 114 [2022-01-11 05:27:33,014 INFO L353 Elim1Store]: treesize reduction 79, result has 39.7 percent of original size [2022-01-11 05:27:33,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 217 [2022-01-11 05:27:33,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 141 [2022-01-11 05:27:33,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 121 [2022-01-11 05:27:33,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_398 (Array Int Int))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_398) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (or (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int| .cse0) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (= (mod (+ .cse1 8) 18446744073709551616) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt| 8) 18446744073709551616)) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|)))) (not (<= 0 .cse1))))) is different from false [2022-01-11 05:27:33,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_398 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt|) v_ArrVal_398) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (or (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt|) 8) 18446744073709551616) (mod (+ .cse0 8) 18446744073709551616)) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt|))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse1 v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) .cse1))) (<= .cse2 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~head#1.offsetInt|) v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_circular_update_at_~data#1Int| .cse2))) (not (<= 0 .cse0))))) is different from false [2022-01-11 05:27:33,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_398 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_398) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse3 v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 8) 18446744073709551616) (mod (+ 8 .cse0) 18446744073709551616)) (<= .cse2 .cse1) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))))))) is different from false [2022-01-11 05:27:33,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_398 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) v_ArrVal_398) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) (mod (+ 8 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) 18446744073709551616) v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|))) (or (not (<= 0 .cse0)) (and (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) (mod (+ 8 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|))) (= (mod (+ .cse0 8) 18446744073709551616) (mod (+ 8 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|)) 18446744073709551616)) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse1 v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.baseInt|) (mod (+ 8 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_#res#1.offsetInt|) .cse1))))))) is different from false [2022-01-11 05:27:33,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_395))) (let ((.cse0 (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_396) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) v_ArrVal_398) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (and (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_396))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) .cse2)))) (= (mod (+ (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) 8) 18446744073709551616) (mod (+ .cse0 8) 18446744073709551616)) (forall ((v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (not (= (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_396))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) v_ArrVal_400)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_402) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|)))))))) is different from false [2022-01-11 05:27:33,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:33,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 198 [2022-01-11 05:27:33,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:33,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 142 [2022-01-11 05:27:33,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 495 [2022-01-11 05:27:33,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1093 treesize of output 1063 [2022-01-11 05:27:33,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:27:33,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 973 treesize of output 949 [2022-01-11 05:27:33,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:27:33,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 875 treesize of output 855 [2022-01-11 05:27:33,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:27:33,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 777 treesize of output 755 [2022-01-11 05:27:33,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 788 treesize of output 742 [2022-01-11 05:27:33,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 721 [2022-01-11 05:27:33,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 640 treesize of output 636 [2022-01-11 05:27:33,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 692 treesize of output 684 [2022-01-11 05:27:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-11 05:27:34,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373872] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:27:34,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:27:34,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 54 [2022-01-11 05:27:34,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285010910] [2022-01-11 05:27:34,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:27:34,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-11 05:27:34,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-11 05:27:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2205, Unknown=6, NotChecked=490, Total=2862 [2022-01-11 05:27:34,048 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 54 states have internal predecessors, (88), 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-01-11 05:27:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:37,154 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-01-11 05:27:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-11 05:27:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 54 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-11 05:27:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:37,156 INFO L225 Difference]: With dead ends: 87 [2022-01-11 05:27:37,156 INFO L226 Difference]: Without dead ends: 85 [2022-01-11 05:27:37,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=554, Invalid=4862, Unknown=6, NotChecked=740, Total=6162 [2022-01-11 05:27:37,158 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 156 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:37,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 299 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 735 Invalid, 0 Unknown, 296 Unchecked, 0.6s Time] [2022-01-11 05:27:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-11 05:27:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2022-01-11 05:27:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 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-01-11 05:27:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-01-11 05:27:37,177 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 32 [2022-01-11 05:27:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:37,178 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-01-11 05:27:37,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 54 states have internal predecessors, (88), 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-01-11 05:27:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-01-11 05:27:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 05:27:37,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:37,182 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:37,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:27:37,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:37,387 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -146075012, now seen corresponding path program 3 times [2022-01-11 05:27:37,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:37,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134763827] [2022-01-11 05:27:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:37,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:27:37,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:37,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134763827] [2022-01-11 05:27:37,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134763827] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:37,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262335334] [2022-01-11 05:27:37,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:27:37,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:37,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:37,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:37,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 05:27:38,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-11 05:27:38,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:27:38,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-11 05:27:38,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:27:38,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:27:38,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262335334] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:27:38,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:27:38,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-11 05:27:38,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685398161] [2022-01-11 05:27:38,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:27:38,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:27:38,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:27:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:27:38,811 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-01-11 05:27:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:39,333 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-01-11 05:27:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:27:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-11 05:27:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:39,334 INFO L225 Difference]: With dead ends: 92 [2022-01-11 05:27:39,335 INFO L226 Difference]: Without dead ends: 84 [2022-01-11 05:27:39,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-01-11 05:27:39,335 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 120 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:39,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 134 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:27:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-11 05:27:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-01-11 05:27:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 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-01-11 05:27:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-01-11 05:27:39,368 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 33 [2022-01-11 05:27:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:39,368 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-01-11 05:27:39,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-01-11 05:27:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-01-11 05:27:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 05:27:39,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:39,369 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:39,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-11 05:27:39,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:39,574 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1553033086, now seen corresponding path program 4 times [2022-01-11 05:27:39,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:39,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083711691] [2022-01-11 05:27:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:39,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:27:39,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083711691] [2022-01-11 05:27:39,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083711691] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635637577] [2022-01-11 05:27:39,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-11 05:27:39,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:39,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:39,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 05:27:39,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-11 05:27:39,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:27:39,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-11 05:27:39,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:27:40,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:27:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:27:40,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635637577] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:27:40,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:27:40,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 11] total 19 [2022-01-11 05:27:40,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105756997] [2022-01-11 05:27:40,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:27:40,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-11 05:27:40,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:27:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-11 05:27:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:27:40,726 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-01-11 05:27:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:27:41,146 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-01-11 05:27:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 05:27:41,147 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-11 05:27:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:27:41,147 INFO L225 Difference]: With dead ends: 71 [2022-01-11 05:27:41,147 INFO L226 Difference]: Without dead ends: 42 [2022-01-11 05:27:41,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-01-11 05:27:41,148 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 103 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:27:41,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 178 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:27:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-11 05:27:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-01-11 05:27:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-01-11 05:27:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-01-11 05:27:41,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2022-01-11 05:27:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:27:41,160 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-01-11 05:27:41,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-01-11 05:27:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-01-11 05:27:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 05:27:41,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:27:41,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:27:41,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:27:41,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:41,375 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:27:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:27:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1580595102, now seen corresponding path program 1 times [2022-01-11 05:27:41,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:27:41,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901053344] [2022-01-11 05:27:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:41,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:27:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:27:41,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:27:41,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901053344] [2022-01-11 05:27:41,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901053344] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:27:41,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241903813] [2022-01-11 05:27:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:27:41,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:27:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:27:41,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:27:41,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 05:27:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:27:42,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-11 05:27:42,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:27:42,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-01-11 05:28:04,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 147 [2022-01-11 05:28:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:28:23,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:24,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 94 [2022-01-11 05:28:24,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:24,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 05:28:24,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241903813] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:24,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:24,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 10] total 32 [2022-01-11 05:28:24,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498227342] [2022-01-11 05:28:24,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:24,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-11 05:28:24,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-11 05:28:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2022-01-11 05:28:24,489 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 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)