/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-7968f31 [2022-03-17 14:56:02,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 14:56:02,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 14:56:02,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 14:56:02,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 14:56:02,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 14:56:02,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 14:56:02,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 14:56:02,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 14:56:02,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 14:56:02,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 14:56:02,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 14:56:02,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 14:56:02,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 14:56:02,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 14:56:02,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 14:56:02,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 14:56:02,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 14:56:02,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 14:56:02,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 14:56:02,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 14:56:02,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 14:56:02,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 14:56:02,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 14:56:02,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 14:56:02,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 14:56:02,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 14:56:02,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 14:56:02,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 14:56:02,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 14:56:02,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 14:56:02,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 14:56:02,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 14:56:02,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 14:56:02,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 14:56:02,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 14:56:02,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 14:56:02,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 14:56:02,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 14:56:02,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 14:56:02,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 14:56:02,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 14:56:02,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 14:56:02,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 14:56:02,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 14:56:02,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 14:56:02,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 14:56:02,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 14:56:02,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 14:56:02,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 14:56:02,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 14:56:02,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 14:56:02,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 14:56:02,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 14:56:02,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 14:56:02,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 14:56:02,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:56:02,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 14:56:02,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 14:56:02,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 14:56:02,864 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 14:56:03,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 14:56:03,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 14:56:03,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 14:56:03,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 14:56:03,070 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 14:56:03,071 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-03-17 14:56:03,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5425dd97/f0489e9181f5499d9d5b1e5f607a5b5c/FLAG711652ec2 [2022-03-17 14:56:03,428 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 14:56:03,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-03-17 14:56:03,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5425dd97/f0489e9181f5499d9d5b1e5f607a5b5c/FLAG711652ec2 [2022-03-17 14:56:03,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5425dd97/f0489e9181f5499d9d5b1e5f607a5b5c [2022-03-17 14:56:03,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 14:56:03,857 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 14:56:03,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 14:56:03,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 14:56:03,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 14:56:03,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:03" (1/1) ... [2022-03-17 14:56:03,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e89593e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:03, skipping insertion in model container [2022-03-17 14:56:03,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:03" (1/1) ... [2022-03-17 14:56:03,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 14:56:03,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 14:56:04,003 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-03-17 14:56:04,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:56:04,023 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 14:56:04,031 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-03-17 14:56:04,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:56:04,044 INFO L208 MainTranslator]: Completed translation [2022-03-17 14:56:04,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04 WrapperNode [2022-03-17 14:56:04,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 14:56:04,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 14:56:04,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 14:56:04,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 14:56:04,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 14:56:04,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 14:56:04,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 14:56:04,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 14:56:04,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:56:04,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:04,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 14:56:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 14:56:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 14:56:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 14:56:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 14:56:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 14:56:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 14:56:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 14:56:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 14:56:04,189 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 14:56:04,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 14:56:04,284 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 14:56:04,288 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 14:56:04,288 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-17 14:56:04,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:56:04 BoogieIcfgContainer [2022-03-17 14:56:04,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 14:56:04,291 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 14:56:04,291 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 14:56:04,292 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 14:56:04,294 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:56:04" (1/1) ... [2022-03-17 14:56:04,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:56:04 BasicIcfg [2022-03-17 14:56:04,307 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 14:56:04,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 14:56:04,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 14:56:04,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 14:56:04,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:03" (1/4) ... [2022-03-17 14:56:04,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7346d6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:04, skipping insertion in model container [2022-03-17 14:56:04,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:04" (2/4) ... [2022-03-17 14:56:04,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7346d6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:04, skipping insertion in model container [2022-03-17 14:56:04,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:56:04" (3/4) ... [2022-03-17 14:56:04,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7346d6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:56:04, skipping insertion in model container [2022-03-17 14:56:04,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:56:04" (4/4) ... [2022-03-17 14:56:04,314 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.iJordan [2022-03-17 14:56:04,318 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 14:56:04,318 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 14:56:04,349 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 14:56:04,355 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 14:56:04,355 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 14:56:04,365 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-03-17 14:56:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-17 14:56:04,373 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:04,373 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:56:04,374 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:04,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1599893512, now seen corresponding path program 1 times [2022-03-17 14:56:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187788852] [2022-03-17 14:56:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187788852] [2022-03-17 14:56:04,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187788852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:56:04,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:56:04,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 14:56:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105576331] [2022-03-17 14:56:04,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:56:04,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 14:56:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 14:56:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 14:56:04,538 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-03-17 14:56:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:04,588 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-03-17 14:56:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 14:56:04,590 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-03-17 14:56:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:04,596 INFO L225 Difference]: With dead ends: 27 [2022-03-17 14:56:04,596 INFO L226 Difference]: Without dead ends: 22 [2022-03-17 14:56:04,597 INFO L911 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-03-17 14:56:04,600 INFO L912 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-03-17 14:56:04,601 INFO L913 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-03-17 14:56:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-17 14:56:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-17 14:56:04,652 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-03-17 14:56:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-03-17 14:56:04,654 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-03-17 14:56:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:04,654 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-03-17 14:56:04,654 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-03-17 14:56:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-03-17 14:56:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-17 14:56:04,663 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:04,664 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:56:04,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 14:56:04,664 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -952263449, now seen corresponding path program 1 times [2022-03-17 14:56:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:04,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585894151] [2022-03-17 14:56:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:04,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585894151] [2022-03-17 14:56:04,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585894151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:56:04,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:56:04,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 14:56:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134871040] [2022-03-17 14:56:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:56:04,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 14:56:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 14:56:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 14:56:04,789 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-03-17 14:56:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:04,870 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-03-17 14:56:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 14:56:04,871 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-03-17 14:56:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:04,872 INFO L225 Difference]: With dead ends: 29 [2022-03-17 14:56:04,872 INFO L226 Difference]: Without dead ends: 29 [2022-03-17 14:56:04,876 INFO L911 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-03-17 14:56:04,877 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:56:04,878 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:56:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-17 14:56:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-03-17 14:56:04,889 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-03-17 14:56:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-03-17 14:56:04,890 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-03-17 14:56:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:04,890 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-03-17 14:56:04,890 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-03-17 14:56:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-03-17 14:56:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 14:56:04,891 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:04,891 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:56:04,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 14:56:04,891 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1051990743, now seen corresponding path program 1 times [2022-03-17 14:56:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283904835] [2022-03-17 14:56:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:05,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283904835] [2022-03-17 14:56:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283904835] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:56:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244059886] [2022-03-17 14:56:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:56:05,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:05,042 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-03-17 14:56:05,043 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-03-17 14:56:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:05,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-17 14:56:05,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:56:05,168 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-03-17 14:56:05,261 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-03-17 14:56:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:05,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:56:05,596 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-03-17 14:56:05,602 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-03-17 14:56:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244059886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:56:05,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:56:05,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 15 [2022-03-17 14:56:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239589164] [2022-03-17 14:56:05,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:56:05,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-17 14:56:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-17 14:56:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-17 14:56:05,702 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-03-17 14:56:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:06,107 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-03-17 14:56:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 14:56:06,108 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-03-17 14:56:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:06,108 INFO L225 Difference]: With dead ends: 41 [2022-03-17 14:56:06,109 INFO L226 Difference]: Without dead ends: 41 [2022-03-17 14:56:06,109 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-03-17 14:56:06,110 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-03-17 14:56:06,111 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 54 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 14:56:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-17 14:56:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-03-17 14:56:06,115 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-03-17 14:56:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-03-17 14:56:06,116 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2022-03-17 14:56:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:06,117 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-03-17 14:56:06,117 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-03-17 14:56:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-03-17 14:56:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-17 14:56:06,118 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:06,118 INFO L500 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-03-17 14:56:06,143 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-03-17 14:56:06,331 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-03-17 14:56:06,332 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1683413027, now seen corresponding path program 1 times [2022-03-17 14:56:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:06,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258514575] [2022-03-17 14:56:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-17 14:56:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:56:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258514575] [2022-03-17 14:56:06,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258514575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:56:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916448096] [2022-03-17 14:56:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:56:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:06,464 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-03-17 14:56:06,493 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-03-17 14:56:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:06,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-17 14:56:06,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:56:06,602 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-03-17 14:56:07,692 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-03-17 14:56:07,692 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-03-17 14:56:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:07,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:56:08,111 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-03-17 14:56:08,121 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-03-17 14:56:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:08,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916448096] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:56:08,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:56:08,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 20 [2022-03-17 14:56:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110906844] [2022-03-17 14:56:08,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:56:08,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 14:56:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 14:56:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-03-17 14:56:08,213 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-03-17 14:56:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:09,086 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-03-17 14:56:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 14:56:09,086 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-03-17 14:56:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:09,090 INFO L225 Difference]: With dead ends: 62 [2022-03-17 14:56:09,090 INFO L226 Difference]: Without dead ends: 62 [2022-03-17 14:56:09,092 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2022-03-17 14:56:09,094 INFO L912 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.3s IncrementalHoareTripleChecker+Time [2022-03-17 14:56:09,095 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 85 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2022-03-17 14:56:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-17 14:56:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2022-03-17 14:56:09,105 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-03-17 14:56:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-03-17 14:56:09,107 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 27 [2022-03-17 14:56:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:09,107 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-03-17 14:56:09,107 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-03-17 14:56:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-03-17 14:56:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 14:56:09,108 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:09,108 INFO L500 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-03-17 14:56:09,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-17 14:56:09,308 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-03-17 14:56:09,309 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1290504993, now seen corresponding path program 2 times [2022-03-17 14:56:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:09,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707351669] [2022-03-17 14:56:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:09,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-03-17 14:56:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:56:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707351669] [2022-03-17 14:56:09,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707351669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:56:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802278019] [2022-03-17 14:56:09,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 14:56:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:56:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:09,398 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-03-17 14:56:09,405 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-03-17 14:56:09,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 14:56:09,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:56:09,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-17 14:56:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:56:09,477 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-03-17 14:56:09,549 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-03-17 14:56:09,549 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-03-17 14:56:11,768 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-03-17 14:56:11,769 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-03-17 14:56:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:11,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:56:12,288 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-03-17 14:56:12,292 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-03-17 14:56:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:56:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802278019] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:56:12,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:56:12,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 24 [2022-03-17 14:56:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638306953] [2022-03-17 14:56:12,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:56:12,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-17 14:56:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-17 14:56:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-03-17 14:56:12,460 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-03-17 14:56:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:13,311 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-03-17 14:56:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 14:56:13,311 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-03-17 14:56:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:13,313 INFO L225 Difference]: With dead ends: 56 [2022-03-17 14:56:13,313 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 14:56:13,314 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-03-17 14:56:13,316 INFO L912 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.2s IncrementalHoareTripleChecker+Time [2022-03-17 14:56:13,318 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 107 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 245 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2022-03-17 14:56:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 14:56:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-03-17 14:56:13,328 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-03-17 14:56:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-03-17 14:56:13,334 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-03-17 14:56:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:13,334 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-03-17 14:56:13,334 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-03-17 14:56:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-03-17 14:56:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-17 14:56:13,335 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:13,336 INFO L500 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-03-17 14:56:13,359 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-03-17 14:56:13,558 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-03-17 14:56:13,559 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash -213422642, now seen corresponding path program 1 times [2022-03-17 14:56:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784981986] [2022-03-17 14:56:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-17 14:56:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-17 14:56:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-17 14:56:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784981986] [2022-03-17 14:56:13,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784981986] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:56:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665932640] [2022-03-17 14:56:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:56:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:13,690 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-03-17 14:56:13,717 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-03-17 14:56:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:13,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-17 14:56:13,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:56:13,792 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-03-17 14:56:13,841 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-03-17 14:56:13,841 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-03-17 14:56:13,916 INFO L356 Elim1Store]: treesize reduction 132, result has 19.0 percent of original size [2022-03-17 14:56:13,916 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-03-17 14:56:14,004 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-17 14:56:14,005 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-03-17 14:56:14,456 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-17 14:56:14,456 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-03-17 14:56:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 14:56:14,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:56:16,735 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-03-17 14:56:16,751 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-17 14:56:16,751 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-03-17 14:56:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 14:56:21,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665932640] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:56:21,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:56:21,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 22] total 42 [2022-03-17 14:56:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047985853] [2022-03-17 14:56:21,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:56:21,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-17 14:56:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:56:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-17 14:56:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2022-03-17 14:56:21,815 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-03-17 14:56:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:56:26,312 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-03-17 14:56:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-17 14:56:26,313 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-03-17 14:56:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:56:26,313 INFO L225 Difference]: With dead ends: 74 [2022-03-17 14:56:26,313 INFO L226 Difference]: Without dead ends: 74 [2022-03-17 14:56:26,315 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=562, Invalid=4268, Unknown=0, NotChecked=0, Total=4830 [2022-03-17 14:56:26,316 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-03-17 14:56:26,316 INFO L913 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-03-17 14:56:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-17 14:56:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-03-17 14:56:26,329 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-03-17 14:56:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-03-17 14:56:26,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 40 [2022-03-17 14:56:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:56:26,330 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-03-17 14:56:26,330 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-03-17 14:56:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-03-17 14:56:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-17 14:56:26,331 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:56:26,331 INFO L500 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-03-17 14:56:26,359 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-03-17 14:56:26,559 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-03-17 14:56:26,559 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:56:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:56:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash 768467414, now seen corresponding path program 2 times [2022-03-17 14:56:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:56:26,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502030811] [2022-03-17 14:56:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:56:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:56:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:56:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-03-17 14:56:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:26,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-17 14:56:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:56:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-17 14:56:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:56:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502030811] [2022-03-17 14:56:26,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502030811] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:56:26,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398935] [2022-03-17 14:56:26,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 14:56:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:56:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:56:26,740 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-03-17 14:56:26,771 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-03-17 14:56:26,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 14:56:26,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:56:26,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-17 14:56:26,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:56:26,891 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-03-17 14:56:26,950 INFO L356 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-03-17 14:56:26,951 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-03-17 14:56:27,022 INFO L356 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2022-03-17 14:56:27,023 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-03-17 14:56:27,096 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-03-17 14:56:27,096 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-03-17 14:56:27,169 INFO L356 Elim1Store]: treesize reduction 158, result has 16.8 percent of original size [2022-03-17 14:56:27,169 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-03-17 14:56:27,248 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-03-17 14:56:27,248 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-03-17 14:56:27,315 INFO L356 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2022-03-17 14:56:27,316 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-03-17 14:56:27,399 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-17 14:56:27,399 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-03-17 14:56:27,857 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-03-17 14:56:27,857 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-03-17 14:56:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 14:56:27,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:56:47,787 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-03-17 14:56:48,072 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-17 14:56:48,076 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-03-17 15:03:17,973 WARN L232 SmtUtils]: Spent 6.50m 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-03-17 15:04:05,724 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-17 15:04:05,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-17 15:04:05,929 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-03-17 15:04:05,930 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:596) 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:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) 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-03-17 15:04:05,935 INFO L158 Benchmark]: Toolchain (without parser) took 482078.33ms. Allocated memory was 176.2MB in the beginning and 921.7MB in the end (delta: 745.5MB). Free memory was 126.8MB in the beginning and 855.7MB in the end (delta: -728.9MB). Peak memory consumption was 547.6MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,935 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 15:04:05,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.28ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 152.5MB in the end (delta: -25.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,935 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 176.2MB. Free memory was 152.5MB in the beginning and 151.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,936 INFO L158 Benchmark]: RCFGBuilder took 208.95ms. Allocated memory is still 176.2MB. Free memory was 150.9MB in the beginning and 140.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,936 INFO L158 Benchmark]: IcfgTransformer took 16.69ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 138.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,936 INFO L158 Benchmark]: TraceAbstraction took 481625.74ms. Allocated memory was 176.2MB in the beginning and 921.7MB in the end (delta: 745.5MB). Free memory was 138.3MB in the beginning and 855.7MB in the end (delta: -717.3MB). Peak memory consumption was 559.0MB. Max. memory is 8.0GB. [2022-03-17 15:04:05,937 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.13ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.28ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 152.5MB in the end (delta: -25.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 176.2MB. Free memory was 152.5MB in the beginning and 151.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 208.95ms. Allocated memory is still 176.2MB. Free memory was 150.9MB in the beginning and 140.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.69ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 138.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 481625.74ms. Allocated memory was 176.2MB in the beginning and 921.7MB in the end (delta: 745.5MB). Free memory was 138.3MB in the beginning and 855.7MB in the end (delta: -717.3MB). Peak memory consumption was 559.0MB. 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-03-17 15:04:06,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...