/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 04:46:06,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 04:46:06,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 04:46:06,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 04:46:06,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 04:46:06,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 04:46:06,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 04:46:06,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 04:46:06,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 04:46:06,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 04:46:06,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 04:46:06,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 04:46:06,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 04:46:06,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 04:46:06,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 04:46:06,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 04:46:06,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 04:46:06,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 04:46:06,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 04:46:06,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 04:46:06,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 04:46:06,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 04:46:06,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 04:46:06,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 04:46:06,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 04:46:06,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 04:46:06,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 04:46:06,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 04:46:06,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 04:46:06,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 04:46:06,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 04:46:06,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 04:46:06,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 04:46:06,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 04:46:06,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 04:46:06,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 04:46:06,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 04:46:06,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 04:46:06,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 04:46:06,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 04:46:06,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 04:46:06,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 04:46:06,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-06 04:46:06,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 04:46:06,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 04:46:06,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 04:46:06,710 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 04:46:06,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 04:46:06,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 04:46:06,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 04:46:06,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 04:46:06,713 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 04:46:06,713 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 04:46:06,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 04:46:06,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 04:46:06,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 04:46:06,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 04:46:06,917 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 04:46:06,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-06 04:46:06,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c2ef44f/98550dc0a98c40ea9e4ff3a1d3d6ddd1/FLAG81963c910 [2022-04-06 04:46:07,279 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 04:46:07,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-06 04:46:07,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c2ef44f/98550dc0a98c40ea9e4ff3a1d3d6ddd1/FLAG81963c910 [2022-04-06 04:46:07,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c2ef44f/98550dc0a98c40ea9e4ff3a1d3d6ddd1 [2022-04-06 04:46:07,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 04:46:07,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 04:46:07,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 04:46:07,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 04:46:07,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 04:46:07,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613eb211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07, skipping insertion in model container [2022-04-06 04:46:07,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 04:46:07,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 04:46:07,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-06 04:46:07,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 04:46:07,480 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 04:46:07,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-06 04:46:07,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 04:46:07,508 INFO L208 MainTranslator]: Completed translation [2022-04-06 04:46:07,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07 WrapperNode [2022-04-06 04:46:07,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 04:46:07,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 04:46:07,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 04:46:07,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 04:46:07,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 04:46:07,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 04:46:07,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 04:46:07,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 04:46:07,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 04:46:07,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:07,564 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-04-06 04:46:07,580 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-04-06 04:46:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 04:46:07,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 04:46:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 04:46:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 04:46:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 04:46:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 04:46:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 04:46:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 04:46:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 04:46:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 04:46:07,653 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 04:46:07,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 04:46:07,753 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 04:46:07,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 04:46:07,756 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-06 04:46:07,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 04:46:07 BoogieIcfgContainer [2022-04-06 04:46:07,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 04:46:07,758 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 04:46:07,758 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 04:46:07,772 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 04:46:07,774 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 04:46:07" (1/1) ... [2022-04-06 04:46:07,776 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-06 04:46:07,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 04:46:07 BasicIcfg [2022-04-06 04:46:07,785 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 04:46:07,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 04:46:07,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 04:46:07,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 04:46:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 04:46:07" (1/4) ... [2022-04-06 04:46:07,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e62f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 04:46:07, skipping insertion in model container [2022-04-06 04:46:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 04:46:07" (2/4) ... [2022-04-06 04:46:07,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e62f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 04:46:07, skipping insertion in model container [2022-04-06 04:46:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 04:46:07" (3/4) ... [2022-04-06 04:46:07,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e62f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 04:46:07, skipping insertion in model container [2022-04-06 04:46:07,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 04:46:07" (4/4) ... [2022-04-06 04:46:07,789 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.iJordan [2022-04-06 04:46:07,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-06 04:46:07,792 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 04:46:07,817 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 04:46:07,821 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 04:46:07,821 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 04:46:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-06 04:46:07,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:07,833 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:07,833 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1599893512, now seen corresponding path program 1 times [2022-04-06 04:46:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:07,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491269239] [2022-04-06 04:46:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491269239] [2022-04-06 04:46:07,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491269239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 04:46:07,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 04:46:07,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 04:46:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852655210] [2022-04-06 04:46:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 04:46:07,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 04:46:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:07,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 04:46:07,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 04:46:07,999 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:08,025 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-06 04:46:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 04:46:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-06 04:46:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:08,031 INFO L225 Difference]: With dead ends: 27 [2022-04-06 04:46:08,032 INFO L226 Difference]: Without dead ends: 22 [2022-04-06 04:46:08,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-06 04:46:08,035 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:08,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 04:46:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-06 04:46:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-06 04:46:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 04:46:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-06 04:46:08,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-06 04:46:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:08,057 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-06 04:46:08,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-06 04:46:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-06 04:46:08,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:08,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:08,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 04:46:08,058 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -952263449, now seen corresponding path program 1 times [2022-04-06 04:46:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:08,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484337067] [2022-04-06 04:46:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:08,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484337067] [2022-04-06 04:46:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484337067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 04:46:08,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 04:46:08,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 04:46:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877913978] [2022-04-06 04:46:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 04:46:08,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 04:46:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 04:46:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 04:46:08,110 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:08,164 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-06 04:46:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 04:46:08,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-06 04:46:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:08,165 INFO L225 Difference]: With dead ends: 29 [2022-04-06 04:46:08,165 INFO L226 Difference]: Without dead ends: 29 [2022-04-06 04:46:08,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 04:46:08,167 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:08,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 04:46:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-06 04:46:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-06 04:46:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 04:46:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-06 04:46:08,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-06 04:46:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:08,171 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-06 04:46:08,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-06 04:46:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 04:46:08,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:08,172 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:08,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 04:46:08,172 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1051990743, now seen corresponding path program 1 times [2022-04-06 04:46:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:08,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408747509] [2022-04-06 04:46:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408747509] [2022-04-06 04:46:08,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408747509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 04:46:08,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577927592] [2022-04-06 04:46:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:08,271 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-04-06 04:46:08,282 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-04-06 04:46:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:08,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-06 04:46:08,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 04:46:08,392 INFO L390 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 11 treesize of output 7 [2022-04-06 04:46:08,456 INFO L390 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 15 treesize of output 7 [2022-04-06 04:46:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:08,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 04:46:08,768 INFO L390 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 43 treesize of output 39 [2022-04-06 04:46:08,775 INFO L390 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 56 treesize of output 52 [2022-04-06 04:46:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577927592] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 04:46:08,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 04:46:08,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2022-04-06 04:46:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818701703] [2022-04-06 04:46:08,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 04:46:08,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-06 04:46:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-06 04:46:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-06 04:46:08,858 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:09,182 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-06 04:46:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-06 04:46:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-06 04:46:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:09,183 INFO L225 Difference]: With dead ends: 41 [2022-04-06 04:46:09,183 INFO L226 Difference]: Without dead ends: 41 [2022-04-06 04:46:09,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-04-06 04:46:09,184 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:09,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 54 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 04:46:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-06 04:46:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-06 04:46:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-06 04:46:09,188 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2022-04-06 04:46:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:09,188 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-06 04:46:09,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 04:46:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-06 04:46:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 04:46:09,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:09,189 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:09,213 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-04-06 04:46:09,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:09,404 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1683413027, now seen corresponding path program 1 times [2022-04-06 04:46:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276459080] [2022-04-06 04:46:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:09,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-06 04:46:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 04:46:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276459080] [2022-04-06 04:46:09,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276459080] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 04:46:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596511668] [2022-04-06 04:46:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:09,492 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-04-06 04:46:09,524 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-04-06 04:46:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:09,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-06 04:46:09,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 04:46:09,600 INFO L390 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 19 treesize of output 15 [2022-04-06 04:46:10,492 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-04-06 04:46:10,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 10 [2022-04-06 04:46:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:10,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 04:46:10,824 INFO L390 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 25 treesize of output 23 [2022-04-06 04:46:10,831 INFO L390 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 48 treesize of output 44 [2022-04-06 04:46:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:10,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596511668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 04:46:10,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 04:46:10,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 20 [2022-04-06 04:46:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922060885] [2022-04-06 04:46:10,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 04:46:10,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-06 04:46:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-06 04:46:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-06 04:46:10,884 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:11,604 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-06 04:46:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-06 04:46:11,604 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-06 04:46:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:11,605 INFO L225 Difference]: With dead ends: 62 [2022-04-06 04:46:11,605 INFO L226 Difference]: Without dead ends: 62 [2022-04-06 04:46:11,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2022-04-06 04:46:11,606 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:11,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 85 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 157 Unchecked, 0.2s Time] [2022-04-06 04:46:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-06 04:46:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2022-04-06 04:46:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 04:46:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-04-06 04:46:11,611 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 27 [2022-04-06 04:46:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:11,611 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-04-06 04:46:11,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-06 04:46:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 04:46:11,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:11,612 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:11,642 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-04-06 04:46:11,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-06 04:46:11,852 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1290504993, now seen corresponding path program 2 times [2022-04-06 04:46:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997844221] [2022-04-06 04:46:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-06 04:46:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 04:46:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:12,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997844221] [2022-04-06 04:46:12,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997844221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 04:46:12,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256117724] [2022-04-06 04:46:12,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 04:46:12,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:12,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:12,090 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-04-06 04:46:12,091 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-04-06 04:46:12,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 04:46:12,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 04:46:12,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 04:46:12,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 04:46:12,290 INFO L390 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 19 treesize of output 15 [2022-04-06 04:46:12,348 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-06 04:46:12,348 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-04-06 04:46:14,370 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-04-06 04:46:14,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 90 treesize of output 38 [2022-04-06 04:46:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:14,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 04:46:14,776 INFO L390 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 36 treesize of output 34 [2022-04-06 04:46:14,779 INFO L390 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 270 treesize of output 262 [2022-04-06 04:46:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 04:46:14,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256117724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 04:46:14,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 04:46:14,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 24 [2022-04-06 04:46:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265059176] [2022-04-06 04:46:14,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 04:46:14,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-06 04:46:14,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-06 04:46:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-06 04:46:14,914 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:15,638 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-06 04:46:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-06 04:46:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-04-06 04:46:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:15,640 INFO L225 Difference]: With dead ends: 56 [2022-04-06 04:46:15,640 INFO L226 Difference]: Without dead ends: 56 [2022-04-06 04:46:15,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-04-06 04:46:15,642 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:15,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 107 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 245 Invalid, 0 Unknown, 171 Unchecked, 0.1s Time] [2022-04-06 04:46:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-06 04:46:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-04-06 04:46:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-06 04:46:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-06 04:46:15,646 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-04-06 04:46:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:15,646 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-06 04:46:15,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 6 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 04:46:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-06 04:46:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-06 04:46:15,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:15,647 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:15,683 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-04-06 04:46:15,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:15,886 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:15,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -213422642, now seen corresponding path program 1 times [2022-04-06 04:46:15,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:15,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41322388] [2022-04-06 04:46:15,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 04:46:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-06 04:46:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 04:46:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:15,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41322388] [2022-04-06 04:46:15,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41322388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 04:46:15,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210047045] [2022-04-06 04:46:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:16,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:16,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:16,003 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-04-06 04:46:16,005 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-04-06 04:46:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-06 04:46:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 04:46:16,074 INFO L390 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 19 treesize of output 15 [2022-04-06 04:46:16,113 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-04-06 04:46:16,113 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-04-06 04:46:16,179 INFO L356 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2022-04-06 04:46:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2022-04-06 04:46:16,243 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-06 04:46:16,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-06 04:46:16,549 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-06 04:46:16,549 INFO L390 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 35 treesize of output 13 [2022-04-06 04:46:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 04:46:16,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 04:46:18,652 INFO L390 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 186 treesize of output 180 [2022-04-06 04:46:18,682 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-06 04:46:18,683 INFO L390 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 12556 treesize of output 12424 [2022-04-06 04:46:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 04:46:24,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210047045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 04:46:24,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 04:46:24,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 22] total 42 [2022-04-06 04:46:24,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984639930] [2022-04-06 04:46:24,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 04:46:24,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-06 04:46:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 04:46:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-06 04:46:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2022-04-06 04:46:24,409 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-06 04:46:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 04:46:29,054 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-06 04:46:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-06 04:46:29,060 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 40 [2022-04-06 04:46:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 04:46:29,061 INFO L225 Difference]: With dead ends: 74 [2022-04-06 04:46:29,061 INFO L226 Difference]: Without dead ends: 74 [2022-04-06 04:46:29,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=562, Invalid=4268, Unknown=0, NotChecked=0, Total=4830 [2022-04-06 04:46:29,063 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 04:46:29,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 208 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 259 Invalid, 0 Unknown, 193 Unchecked, 0.3s Time] [2022-04-06 04:46:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-06 04:46:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-04-06 04:46:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-06 04:46:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-04-06 04:46:29,068 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 40 [2022-04-06 04:46:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 04:46:29,068 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-04-06 04:46:29,068 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 40 states have internal predecessors, (78), 8 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-06 04:46:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-06 04:46:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-06 04:46:29,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 04:46:29,080 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 04:46:29,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 04:46:29,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:29,281 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 04:46:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 04:46:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 768467414, now seen corresponding path program 2 times [2022-04-06 04:46:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 04:46:29,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421931331] [2022-04-06 04:46:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 04:46:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 04:46:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 04:46:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-06 04:46:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-06 04:46:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 04:46:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 04:46:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 04:46:29,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421931331] [2022-04-06 04:46:29,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421931331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 04:46:29,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524653036] [2022-04-06 04:46:29,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 04:46:29,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:46:29,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 04:46:29,464 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-04-06 04:46:29,500 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-04-06 04:46:29,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 04:46:29,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 04:46:29,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-06 04:46:29,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 04:46:29,596 INFO L390 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 19 treesize of output 15 [2022-04-06 04:46:29,662 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-04-06 04:46:29,662 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-04-06 04:46:29,736 INFO L356 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2022-04-06 04:46:29,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2022-04-06 04:46:29,805 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-04-06 04:46:29,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2022-04-06 04:46:29,871 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-04-06 04:46:29,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 56 [2022-04-06 04:46:29,929 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-06 04:46:29,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-06 04:46:29,983 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-04-06 04:46:29,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-04-06 04:46:30,050 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-06 04:46:30,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-06 04:46:30,493 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-06 04:46:30,494 INFO L390 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 35 treesize of output 13 [2022-04-06 04:46:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 04:46:30,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 04:46:55,241 INFO L390 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 314 [2022-04-06 04:46:55,447 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-06 04:46:55,450 INFO L390 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 286221380 treesize of output 286155588 [2022-04-06 04:53:44,481 WARN L232 SmtUtils]: Spent 6.82m on a formula simplification that was a NOOP. DAG size: 2622 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-06 04:54:36,507 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-06 04:54:36,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-06 04:54:36,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 04:54:36,711 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-06 04:54:36,716 INFO L158 Benchmark]: Toolchain (without parser) took 509418.45ms. Allocated memory was 203.4MB in the beginning and 1.2GB in the end (delta: 959.4MB). Free memory was 154.2MB in the beginning and 1.0GB in the end (delta: -854.5MB). Peak memory consumption was 692.3MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,717 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 170.5MB in the beginning and 170.4MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 04:54:36,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.58ms. Allocated memory was 203.4MB in the beginning and 250.6MB in the end (delta: 47.2MB). Free memory was 154.0MB in the beginning and 227.7MB in the end (delta: -73.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,717 INFO L158 Benchmark]: Boogie Preprocessor took 33.74ms. Allocated memory is still 250.6MB. Free memory was 227.7MB in the beginning and 226.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,717 INFO L158 Benchmark]: RCFGBuilder took 214.06ms. Allocated memory is still 250.6MB. Free memory was 226.1MB in the beginning and 215.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,717 INFO L158 Benchmark]: IcfgTransformer took 26.60ms. Allocated memory is still 250.6MB. Free memory was 215.2MB in the beginning and 214.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,718 INFO L158 Benchmark]: TraceAbstraction took 508930.38ms. Allocated memory was 250.6MB in the beginning and 1.2GB in the end (delta: 912.3MB). Free memory was 213.5MB in the beginning and 1.0GB in the end (delta: -795.2MB). Peak memory consumption was 704.5MB. Max. memory is 8.0GB. [2022-04-06 04:54:36,719 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 170.5MB in the beginning and 170.4MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.58ms. Allocated memory was 203.4MB in the beginning and 250.6MB in the end (delta: 47.2MB). Free memory was 154.0MB in the beginning and 227.7MB in the end (delta: -73.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.74ms. Allocated memory is still 250.6MB. Free memory was 227.7MB in the beginning and 226.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 214.06ms. Allocated memory is still 250.6MB. Free memory was 226.1MB in the beginning and 215.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 26.60ms. Allocated memory is still 250.6MB. Free memory was 215.2MB in the beginning and 214.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 508930.38ms. Allocated memory was 250.6MB in the beginning and 1.2GB in the end (delta: 912.3MB). Free memory was 213.5MB in the beginning and 1.0GB in the end (delta: -795.2MB). Peak memory consumption was 704.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-06 04:54:36,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...