/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/array-fpi/indp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:15:56,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:15:56,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:15:56,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:15:56,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:15:56,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:15:56,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:15:56,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:15:56,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:15:56,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:15:56,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:15:56,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:15:56,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:15:56,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:15:56,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:15:56,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:15:56,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:15:56,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:15:56,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:15:56,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:15:56,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:15:56,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:15:56,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:15:56,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:15:56,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:15:56,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:15:56,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:15:56,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:15:56,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:15:56,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:15:56,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:15:56,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:15:56,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:15:56,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:15:56,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:15:56,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:15:56,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:15:56,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:15:56,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:15:56,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:15:56,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:15:56,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:15:56,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:15:56,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:15:56,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:15:56,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:15:56,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:15:56,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:15:56,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:15:56,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:15:56,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:15:56,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:15:56,991 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:15:56,991 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-01-31 11:15:57,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:15:57,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:15:57,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:15:57,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:15:57,207 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:15:57,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp2.c [2022-01-31 11:15:57,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02803eeec/9450ff9f82e044d7a1bb8c103eafa9ca/FLAG919a404a0 [2022-01-31 11:15:57,692 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:15:57,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp2.c [2022-01-31 11:15:57,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02803eeec/9450ff9f82e044d7a1bb8c103eafa9ca/FLAG919a404a0 [2022-01-31 11:15:57,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02803eeec/9450ff9f82e044d7a1bb8c103eafa9ca [2022-01-31 11:15:57,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:15:57,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:15:57,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:15:57,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:15:57,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:15:57,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:57,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51523e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57, skipping insertion in model container [2022-01-31 11:15:57,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:57,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:15:57,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:15:57,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp2.c[588,601] [2022-01-31 11:15:57,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:15:57,949 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:15:57,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp2.c[588,601] [2022-01-31 11:15:57,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:15:57,989 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:15:57,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57 WrapperNode [2022-01-31 11:15:57,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:15:57,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:15:57,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:15:57,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:15:57,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:57,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:15:58,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:15:58,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:15:58,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:15:58,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (1/1) ... [2022-01-31 11:15:58,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:15:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:15:58,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 11:15:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 11:15:58,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:15:58,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:15:58,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:15:58,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:15:58,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:15:58,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:15:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:15:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:15:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:15:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:15:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:15:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:15:58,141 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:15:58,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:15:58,250 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:15:58,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:15:58,255 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 11:15:58,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:15:58 BoogieIcfgContainer [2022-01-31 11:15:58,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:15:58,257 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:15:58,257 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:15:58,258 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:15:58,261 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:15:58" (1/1) ... [2022-01-31 11:15:58,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:15:58 BasicIcfg [2022-01-31 11:15:58,280 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:15:58,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:15:58,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:15:58,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:15:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:15:57" (1/4) ... [2022-01-31 11:15:58,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de8adbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:15:58, skipping insertion in model container [2022-01-31 11:15:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:15:57" (2/4) ... [2022-01-31 11:15:58,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de8adbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:15:58, skipping insertion in model container [2022-01-31 11:15:58,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:15:58" (3/4) ... [2022-01-31 11:15:58,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de8adbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:15:58, skipping insertion in model container [2022-01-31 11:15:58,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:15:58" (4/4) ... [2022-01-31 11:15:58,286 INFO L111 eAbstractionObserver]: Analyzing ICFG indp2.cJordan [2022-01-31 11:15:58,291 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:15:58,291 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:15:58,362 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:15:58,368 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 11:15:58,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:15:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:15:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:15:58,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:15:58,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:15:58,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:15:58,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:15:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1511364421, now seen corresponding path program 1 times [2022-01-31 11:15:58,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:15:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427426904] [2022-01-31 11:15:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:15:58,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:15:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:15:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:15:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:15:58,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:15:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427426904] [2022-01-31 11:15:58,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427426904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:15:58,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:15:58,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:15:58,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845970792] [2022-01-31 11:15:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:15:58,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:15:58,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:15:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:15:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:15:58,700 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:15:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:15:58,774 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-01-31 11:15:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:15:58,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-01-31 11:15:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:15:58,783 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:15:58,783 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 11:15:58,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:15:58,797 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:15:58,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:15:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 11:15:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-31 11:15:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:15:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-31 11:15:58,830 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-01-31 11:15:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:15:58,831 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-31 11:15:58,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:15:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-31 11:15:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 11:15:58,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:15:58,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:15:58,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:15:58,833 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:15:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:15:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1574252543, now seen corresponding path program 1 times [2022-01-31 11:15:58,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:15:58,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865285687] [2022-01-31 11:15:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:15:58,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:15:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:15:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:15:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:15:58,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:15:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865285687] [2022-01-31 11:15:58,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865285687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:15:58,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:15:58,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:15:58,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478780768] [2022-01-31 11:15:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:15:59,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:15:59,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:15:59,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:15:59,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:15:59,004 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:15:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:15:59,143 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-31 11:15:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:15:59,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-01-31 11:15:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:15:59,146 INFO L225 Difference]: With dead ends: 42 [2022-01-31 11:15:59,146 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 11:15:59,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:15:59,148 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:15:59,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:15:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 11:15:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-01-31 11:15:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:15:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 11:15:59,156 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2022-01-31 11:15:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:15:59,156 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 11:15:59,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:15:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 11:15:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:15:59,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:15:59,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:15:59,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:15:59,158 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:15:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:15:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1521490391, now seen corresponding path program 1 times [2022-01-31 11:15:59,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:15:59,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648896420] [2022-01-31 11:15:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:15:59,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:15:59,183 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:15:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878986144] [2022-01-31 11:15:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:15:59,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:15:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:15:59,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:15:59,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 11:15:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:15:59,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:15:59,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:15:59,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:15:59,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-31 11:15:59,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 11:15:59,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:15:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:15:59,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:15:59,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 11:15:59,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-01-31 11:15:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:15:59,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:15:59,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648896420] [2022-01-31 11:15:59,838 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:15:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878986144] [2022-01-31 11:15:59,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878986144] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:15:59,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:15:59,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-01-31 11:15:59,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54647272] [2022-01-31 11:15:59,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:15:59,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:15:59,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:15:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:15:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:15:59,842 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:00,033 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-01-31 11:16:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 11:16:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-01-31 11:16:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:00,035 INFO L225 Difference]: With dead ends: 63 [2022-01-31 11:16:00,035 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 11:16:00,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:16:00,037 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:00,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 269 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:16:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 11:16:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-01-31 11:16:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:16:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-01-31 11:16:00,044 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 30 [2022-01-31 11:16:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:00,044 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-01-31 11:16:00,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-01-31 11:16:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:16:00,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:00,046 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:00,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:16:00,270 WARN L452 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-01-31 11:16:00,271 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1761797523, now seen corresponding path program 2 times [2022-01-31 11:16:00,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40724067] [2022-01-31 11:16:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:00,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:00,288 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641983514] [2022-01-31 11:16:00,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:16:00,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:00,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:00,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:00,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 11:16:00,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:16:00,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:16:00,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:16:00,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 11:16:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:16:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 11:16:00,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:16:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40724067] [2022-01-31 11:16:00,516 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:16:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641983514] [2022-01-31 11:16:00,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641983514] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:16:00,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:16:00,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 11:16:00,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251195990] [2022-01-31 11:16:00,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:16:00,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:16:00,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:16:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:16:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:16:00,518 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:00,644 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-01-31 11:16:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:16:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 11:16:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:00,650 INFO L225 Difference]: With dead ends: 80 [2022-01-31 11:16:00,650 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 11:16:00,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:16:00,653 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:00,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 127 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:16:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 11:16:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2022-01-31 11:16:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:16:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-01-31 11:16:00,678 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2022-01-31 11:16:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:00,678 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-01-31 11:16:00,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-01-31 11:16:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:16:00,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:00,679 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:00,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:16:00,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 11:16:00,896 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1878370893, now seen corresponding path program 3 times [2022-01-31 11:16:00,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:00,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099327662] [2022-01-31 11:16:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:00,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:00,910 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:00,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438406555] [2022-01-31 11:16:00,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:16:00,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:00,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:00,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:00,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 11:16:00,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:16:00,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:16:00,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:16:00,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:16:01,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:16:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:16:01,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:16:01,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099327662] [2022-01-31 11:16:01,213 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:16:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438406555] [2022-01-31 11:16:01,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438406555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:16:01,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:16:01,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:16:01,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722643403] [2022-01-31 11:16:01,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:16:01,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:16:01,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:16:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:16:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:16:01,216 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:01,393 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-01-31 11:16:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:16:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-01-31 11:16:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:01,397 INFO L225 Difference]: With dead ends: 96 [2022-01-31 11:16:01,398 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 11:16:01,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:16:01,399 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:01,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 132 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:16:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 11:16:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2022-01-31 11:16:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:16:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-01-31 11:16:01,415 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 38 [2022-01-31 11:16:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:01,415 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-01-31 11:16:01,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-01-31 11:16:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:16:01,416 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:01,416 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:01,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:16:01,630 WARN L452 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-01-31 11:16:01,630 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1358624121, now seen corresponding path program 4 times [2022-01-31 11:16:01,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:01,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518742790] [2022-01-31 11:16:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:01,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:01,644 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:01,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516130503] [2022-01-31 11:16:01,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:16:01,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:01,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 11:16:01,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:16:01,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:16:01,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 11:16:01,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:01,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-01-31 11:16:01,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:01,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-01-31 11:16:01,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:01,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:01,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-01-31 11:16:01,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:01,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:01,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:16:02,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:16:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:16:02,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:16:04,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int)) (or (forall ((v_ArrVal_139 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_59)))) is different from false [2022-01-31 11:16:07,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_60 Int)) (or (forall ((v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_60)))) is different from false [2022-01-31 11:16:09,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_60 Int) (v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_60)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) is different from false [2022-01-31 11:16:11,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))))) is different from false [2022-01-31 11:16:13,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) is different from false [2022-01-31 11:16:15,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_64 Int)) (or (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_64)))) is different from false [2022-01-31 11:16:18,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse1 .cse2 (+ (* (- 1) (* c_main_~i~0 c_main_~i~0)) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_64)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) is different from false [2022-01-31 11:16:18,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (select .cse1 c_main_~a~0.offset))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)) (not (<= 1 v_main_~i~0_64)))) is different from false [2022-01-31 11:16:30,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))))) is different from false [2022-01-31 11:16:32,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 Int) (v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_main_~i~0_67 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_126) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) is different from false [2022-01-31 11:16:35,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_68 Int)) (or (forall ((v_ArrVal_126 Int) (v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_main_~i~0_67 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_68 8)) v_ArrVal_126) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_68 1) v_main_~i~0_67)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_68)))) is different from false [2022-01-31 11:16:35,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-01-31 11:16:35,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 876 treesize of output 868 [2022-01-31 11:16:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2022-01-31 11:16:35,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:16:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518742790] [2022-01-31 11:16:35,386 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:16:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516130503] [2022-01-31 11:16:35,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516130503] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:16:35,386 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:16:35,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 32 [2022-01-31 11:16:35,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277176144] [2022-01-31 11:16:35,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:16:35,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 11:16:35,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:16:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 11:16:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=357, Unknown=14, NotChecked=528, Total=992 [2022-01-31 11:16:35,390 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 32 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:37,416 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_68 Int)) (or (forall ((v_ArrVal_126 Int) (v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_main_~i~0_67 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_68 8)) v_ArrVal_126) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_68 1) v_main_~i~0_67)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_68)))) (= (* (+ c_main_~i~0 1) (+ (- 1) c_main_~i~0)) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))))) is different from false [2022-01-31 11:16:39,433 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (select .cse1 c_main_~a~0.offset))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)) (not (<= 1 v_main_~i~0_64)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_67 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_67)) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse2 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_67 8) c_main_~a~0.offset) v_ArrVal_133))) (store .cse2 c_main_~a~0.offset (+ (select .cse2 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59))))))) is different from false [2022-01-31 11:16:39,972 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (select .cse1 c_main_~a~0.offset))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)) (not (<= 1 v_main_~i~0_64)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) (<= 2 c_main_~i~0) (= c_main_~a~0.offset 0)) is different from false [2022-01-31 11:16:40,451 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (select .cse1 c_main_~a~0.offset))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)) (not (<= 1 v_main_~i~0_64)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) (= c_main_~a~0.offset 0)) is different from false [2022-01-31 11:16:40,929 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_64 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse1 .cse2 (+ (* (- 1) (* c_main_~i~0 c_main_~i~0)) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_64)) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (= c_main_~a~0.offset 0) (= (* (+ c_main_~i~0 1) (+ (- 1) c_main_~i~0)) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))))) is different from false [2022-01-31 11:16:42,934 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_64 Int)) (or (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_ArrVal_131 Int) (v_main_~i~0_59 Int) (v_main_~i~0_63 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (not (<= 1 v_main_~i~0_60)) (= (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_131) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_64 1) v_main_~i~0_63)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_64)))) (= (* (+ c_main_~i~0 1) (+ (- 1) c_main_~i~0)) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))))) is different from false [2022-01-31 11:16:44,947 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_main_~i~0_60 Int) (v_ArrVal_133 Int) (v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_133))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_60)) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59))))))) is different from false [2022-01-31 11:16:46,963 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_59 Int)) (or (forall ((v_ArrVal_139 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_59)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 0)) is different from false [2022-01-31 11:16:48,970 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))) (+ (* (+ c_main_~i~0 1) (+ (- 1) c_main_~i~0)) 1)) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_60 Int)) (or (forall ((v_main_~i~0_59 Int) (v_ArrVal_139 Int) (v_ArrVal_138 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_60 8) c_main_~a~0.offset) v_ArrVal_138) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_60 1) v_main_~i~0_59)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_60))))) is different from false [2022-01-31 11:16:50,974 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_59 Int)) (or (forall ((v_ArrVal_139 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_59 8)) v_ArrVal_139) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_59)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 0)) is different from false [2022-01-31 11:16:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:51,141 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-01-31 11:16:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 11:16:51,142 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:16:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:51,143 INFO L225 Difference]: With dead ends: 141 [2022-01-31 11:16:51,143 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 11:16:51,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=141, Invalid=519, Unknown=24, NotChecked=1386, Total=2070 [2022-01-31 11:16:51,144 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:51,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 432 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 194 Invalid, 0 Unknown, 526 Unchecked, 0.1s Time] [2022-01-31 11:16:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 11:16:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2022-01-31 11:16:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:16:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-01-31 11:16:51,151 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 42 [2022-01-31 11:16:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:51,152 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-01-31 11:16:51,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.0) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-01-31 11:16:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:16:51,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:51,153 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:51,183 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-01-31 11:16:51,380 WARN L452 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-01-31 11:16:51,381 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -188567964, now seen corresponding path program 1 times [2022-01-31 11:16:51,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286308613] [2022-01-31 11:16:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:51,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:51,391 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107746332] [2022-01-31 11:16:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:51,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:51,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:51,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:51,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 11:16:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:16:51,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-31 11:16:51,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:51,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 11:16:51,561 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:16:51,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:16:51,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:16:51,617 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:16:51,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:16:51,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-01-31 11:16:51,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:16:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:16:51,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:16:54,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 11:16:54,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-01-31 11:16:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:16:54,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:16:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286308613] [2022-01-31 11:16:54,725 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:16:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107746332] [2022-01-31 11:16:54,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107746332] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:16:54,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:16:54,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 22 [2022-01-31 11:16:54,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037129342] [2022-01-31 11:16:54,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:16:54,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 11:16:54,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:16:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 11:16:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2022-01-31 11:16:54,728 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 11:16:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:55,214 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2022-01-31 11:16:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:16:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2022-01-31 11:16:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:55,216 INFO L225 Difference]: With dead ends: 189 [2022-01-31 11:16:55,216 INFO L226 Difference]: Without dead ends: 164 [2022-01-31 11:16:55,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=106, Invalid=648, Unknown=2, NotChecked=0, Total=756 [2022-01-31 11:16:55,217 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:55,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 378 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 467 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-01-31 11:16:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-31 11:16:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2022-01-31 11:16:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 114 states have internal predecessors, (130), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:16:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2022-01-31 11:16:55,225 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 44 [2022-01-31 11:16:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:55,226 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2022-01-31 11:16:55,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 11:16:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2022-01-31 11:16:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:16:55,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:55,227 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:55,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:16:55,447 WARN L452 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-01-31 11:16:55,448 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1192927485, now seen corresponding path program 5 times [2022-01-31 11:16:55,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:55,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425190362] [2022-01-31 11:16:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:55,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:55,459 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:55,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593383566] [2022-01-31 11:16:55,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:16:55,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:55,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:55,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:55,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:16:55,596 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:16:55,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:16:55,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:16:55,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:16:55,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:16:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:16:55,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:16:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425190362] [2022-01-31 11:16:55,872 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:16:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593383566] [2022-01-31 11:16:55,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593383566] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:16:55,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:16:55,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:16:55,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844510364] [2022-01-31 11:16:55,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:16:55,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:16:55,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:16:55,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:16:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:16:55,881 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:16:56,203 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-01-31 11:16:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:16:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:16:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:16:56,205 INFO L225 Difference]: With dead ends: 177 [2022-01-31 11:16:56,205 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 11:16:56,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:16:56,206 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:16:56,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 234 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:16:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 11:16:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 128. [2022-01-31 11:16:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.1228070175438596) internal successors, (128), 116 states have internal predecessors, (128), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:16:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-01-31 11:16:56,214 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 44 [2022-01-31 11:16:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:16:56,214 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-01-31 11:16:56,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:16:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-01-31 11:16:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 11:16:56,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:16:56,216 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:16:56,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-31 11:16:56,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:56,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:16:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:16:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash -665874081, now seen corresponding path program 6 times [2022-01-31 11:16:56,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:16:56,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207412123] [2022-01-31 11:16:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:16:56,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:16:56,441 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:16:56,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450526265] [2022-01-31 11:16:56,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:16:56,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:16:56,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:16:56,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:16:56,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:16:56,712 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:16:56,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:16:56,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-31 11:16:56,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:16:56,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:16:56,786 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:16:56,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-01-31 11:16:56,843 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:16:56,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-01-31 11:16:56,897 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:16:56,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-01-31 11:16:57,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:16:57,027 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:16:57,027 INFO L387 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 1 case distinctions, treesize of input 41 treesize of output 41 [2022-01-31 11:16:57,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:57,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:16:57,104 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:16:57,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-01-31 11:16:57,168 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:16:57,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2022-01-31 11:16:57,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:16:57,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:16:57,292 INFO L387 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 1 case distinctions, treesize of input 37 treesize of output 33 [2022-01-31 11:16:57,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:57,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-31 11:16:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:57,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-31 11:16:57,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:16:57,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-31 11:16:57,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:16:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:16:57,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:17:20,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_123 Int)) (or (forall ((v_ArrVal_297 Int) (v_ArrVal_285 Int) (v_ArrVal_296 Int) (v_ArrVal_293 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_116 Int)) (or (not (< v_main_~i~0_116 c_~N~0)) (= (select (store (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_123)) v_ArrVal_285))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_118) c_main_~a~0.offset) v_ArrVal_293) (+ c_main_~a~0.offset (* 8 v_main_~i~0_117)) v_ArrVal_296) (+ (* 8 v_main_~i~0_116) c_main_~a~0.offset) v_ArrVal_297) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= 1 v_main_~i~0_118)) (not (<= (+ v_main_~i~0_117 1) v_main_~i~0_116)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_123)))) is different from false [2022-01-31 11:17:42,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_277 Int) (v_ArrVal_297 Int) (v_ArrVal_296 Int) (v_ArrVal_293 Int) (v_ArrVal_281 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_127 Int) (v_main_~i~0_116 Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_277) (+ (* 8 v_main_~i~0_127) c_main_~a~0.offset 8) v_ArrVal_281))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_118) c_main_~a~0.offset) v_ArrVal_293) (+ c_main_~a~0.offset (* 8 v_main_~i~0_117)) v_ArrVal_296) (+ (* 8 v_main_~i~0_116) c_main_~a~0.offset) v_ArrVal_297) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_127 (+ main_~i~0 1))) (<= (+ 2 v_main_~i~0_127) v_main_~i~0_116) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= 1 v_main_~i~0_118)) (not (<= (+ v_main_~i~0_117 1) v_main_~i~0_116)))) is different from false [2022-01-31 11:17:42,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2022-01-31 11:17:42,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 525 treesize of output 521 [2022-01-31 11:17:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-31 11:17:42,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:17:42,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207412123] [2022-01-31 11:17:42,444 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:17:42,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450526265] [2022-01-31 11:17:42,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450526265] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:17:42,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:17:42,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2022-01-31 11:17:42,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439587369] [2022-01-31 11:17:42,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:17:42,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 11:17:42,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:17:42,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 11:17:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1595, Unknown=10, NotChecked=170, Total=2070 [2022-01-31 11:17:42,447 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:17:43,102 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)))) (and .cse0 (forall ((main_~i~0 Int) (v_ArrVal_277 Int) (v_ArrVal_297 Int) (v_ArrVal_296 Int) (v_ArrVal_293 Int) (v_ArrVal_281 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_127 Int) (v_main_~i~0_116 Int)) (or (= (select (store (store (store (let ((.cse1 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_277) (+ (* 8 v_main_~i~0_127) c_main_~a~0.offset 8) v_ArrVal_281))) (store .cse1 c_main_~a~0.offset (+ (select .cse1 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_118) c_main_~a~0.offset) v_ArrVal_293) (+ c_main_~a~0.offset (* 8 v_main_~i~0_117)) v_ArrVal_296) (+ (* 8 v_main_~i~0_116) c_main_~a~0.offset) v_ArrVal_297) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_127 (+ main_~i~0 1))) (<= (+ 2 v_main_~i~0_127) v_main_~i~0_116) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= 1 v_main_~i~0_118)) (not (<= (+ v_main_~i~0_117 1) v_main_~i~0_116)))) (= c_main_~i~0 0) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (or .cse0 (<= c_main_~i~0 2)))) is different from false [2022-01-31 11:17:43,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)))) (and .cse0 (forall ((main_~i~0 Int) (v_ArrVal_277 Int) (v_ArrVal_297 Int) (v_ArrVal_296 Int) (v_ArrVal_293 Int) (v_ArrVal_281 Int) (v_main_~i~0_117 Int) (v_main_~i~0_118 Int) (v_main_~i~0_127 Int) (v_main_~i~0_116 Int)) (or (= (select (store (store (store (let ((.cse1 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 8)) v_ArrVal_277) (+ (* 8 v_main_~i~0_127) c_main_~a~0.offset 8) v_ArrVal_281))) (store .cse1 c_main_~a~0.offset (+ (select .cse1 c_main_~a~0.offset) 1))) (+ (* 8 v_main_~i~0_118) c_main_~a~0.offset) v_ArrVal_293) (+ c_main_~a~0.offset (* 8 v_main_~i~0_117)) v_ArrVal_296) (+ (* 8 v_main_~i~0_116) c_main_~a~0.offset) v_ArrVal_297) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_127 (+ main_~i~0 1))) (<= (+ 2 v_main_~i~0_127) v_main_~i~0_116) (not (<= (+ v_main_~i~0_118 1) v_main_~i~0_117)) (not (<= 1 v_main_~i~0_118)) (not (<= (+ v_main_~i~0_117 1) v_main_~i~0_116)))) (= c_main_~a~0.offset 0) (let ((.cse2 (< c_main_~i~0 (+ c_~N~0 1)))) (or (and (<= c_main_~i~0 3) .cse2) (and .cse0 .cse2))))) is different from false [2022-01-31 11:18:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:18:00,418 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-01-31 11:18:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:18:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 11:18:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:18:00,420 INFO L225 Difference]: With dead ends: 200 [2022-01-31 11:18:00,420 INFO L226 Difference]: Without dead ends: 200 [2022-01-31 11:18:00,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=541, Invalid=2995, Unknown=20, NotChecked=476, Total=4032 [2022-01-31 11:18:00,422 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:18:00,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 407 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 225 Invalid, 0 Unknown, 407 Unchecked, 0.1s Time] [2022-01-31 11:18:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-31 11:18:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 138. [2022-01-31 11:18:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.1209677419354838) internal successors, (139), 126 states have internal predecessors, (139), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 11:18:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2022-01-31 11:18:00,429 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 48 [2022-01-31 11:18:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:18:00,429 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2022-01-31 11:18:00,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:18:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-01-31 11:18:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:18:00,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:18:00,430 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:18:00,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:18:00,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:18:00,656 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:18:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:18:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 623220955, now seen corresponding path program 7 times [2022-01-31 11:18:00,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:18:00,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419004577] [2022-01-31 11:18:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:18:00,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:18:00,666 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:18:00,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112610847] [2022-01-31 11:18:00,666 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:18:00,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:18:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:18:00,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:18:00,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 11:18:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:18:00,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:18:00,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:18:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:18:00,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:18:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:18:00,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:18:00,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419004577] [2022-01-31 11:18:00,978 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:18:00,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112610847] [2022-01-31 11:18:00,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112610847] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:18:00,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:18:00,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:18:00,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140712056] [2022-01-31 11:18:00,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:18:00,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:18:00,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:18:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:18:00,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:18:00,979 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:18:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:18:01,363 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-01-31 11:18:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:18:01,363 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:18:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:18:01,364 INFO L225 Difference]: With dead ends: 172 [2022-01-31 11:18:01,364 INFO L226 Difference]: Without dead ends: 172 [2022-01-31 11:18:01,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-01-31 11:18:01,365 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 102 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:18:01,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 199 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:18:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-31 11:18:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2022-01-31 11:18:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 113 states have (on average 1.1061946902654867) internal successors, (125), 114 states have internal predecessors, (125), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:18:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-01-31 11:18:01,370 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 50 [2022-01-31 11:18:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:18:01,371 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-01-31 11:18:01,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:18:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-01-31 11:18:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:18:01,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:18:01,372 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:18:01,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:18:01,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 11:18:01,584 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:18:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:18:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 437073400, now seen corresponding path program 2 times [2022-01-31 11:18:01,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:18:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873568604] [2022-01-31 11:18:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:18:01,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:18:01,609 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:18:01,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950516470] [2022-01-31 11:18:01,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:18:01,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:18:01,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:18:01,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:18:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 11:18:01,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:18:01,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:18:01,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:18:01,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:18:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:18:01,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:18:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 11:18:01,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:18:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873568604] [2022-01-31 11:18:01,941 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:18:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950516470] [2022-01-31 11:18:01,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950516470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:18:01,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:18:01,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:18:01,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680965784] [2022-01-31 11:18:01,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:18:01,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:18:01,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:18:01,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:18:01,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:18:01,943 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:18:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:18:02,137 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-01-31 11:18:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:18:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-01-31 11:18:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:18:02,138 INFO L225 Difference]: With dead ends: 171 [2022-01-31 11:18:02,138 INFO L226 Difference]: Without dead ends: 166 [2022-01-31 11:18:02,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-01-31 11:18:02,139 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 99 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:18:02,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 166 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:18:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-31 11:18:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2022-01-31 11:18:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 130 states have internal predecessors, (139), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:18:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2022-01-31 11:18:02,144 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 54 [2022-01-31 11:18:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:18:02,145 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2022-01-31 11:18:02,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:18:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2022-01-31 11:18:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:18:02,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:18:02,146 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:18:02,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 11:18:02,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:18:02,356 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:18:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:18:02,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1974105911, now seen corresponding path program 8 times [2022-01-31 11:18:02,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:18:02,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905051211] [2022-01-31 11:18:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:18:02,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:18:02,367 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:18:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33465008] [2022-01-31 11:18:02,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:18:02,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:18:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:18:02,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:18:02,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 11:18:02,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:18:02,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:18:02,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-31 11:18:02,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:18:02,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-01-31 11:18:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-01-31 11:18:02,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:18:02,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-01-31 11:18:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:18:02,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:18:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:18:02,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:18:02,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:18:02,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 11:18:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:18:02,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:18:05,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_192 Int)) (or (forall ((v_ArrVal_495 Int)) (= (- 1) (+ (- 1) (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_192)))) is different from false [2022-01-31 11:18:07,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_193 Int)) (or (forall ((v_ArrVal_495 Int) (v_ArrVal_493 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_193)))) is different from false [2022-01-31 11:18:09,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_ArrVal_491 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_193)))) is different from false [2022-01-31 11:18:11,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_194 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_194)) (forall ((v_ArrVal_495 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_ArrVal_491 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))))) is different from false [2022-01-31 11:18:14,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_194)) (= (- 1) (+ (- 1) (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) is different from false [2022-01-31 11:18:16,118 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_195 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_195)) (forall ((v_ArrVal_495 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))))) is different from false [2022-01-31 11:18:18,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_495 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_195)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) is different from false [2022-01-31 11:18:21,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_198 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_198)) (forall ((v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)))))) is different from false [2022-01-31 11:18:23,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_main_~i~0_198 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_198)) (not (<= 1 v_main_~i~0_195)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) is different from false [2022-01-31 11:18:25,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_199 Int)) (or (forall ((v_ArrVal_485 Int) (v_main_~i~0_198 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_199)))) is different from false [2022-01-31 11:18:27,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_199 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_199)) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) is different from false [2022-01-31 11:18:30,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_200 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_200)) (forall ((v_main_~i~0_199 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (= (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_200) c_main_~a~0.offset) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset)) (- 1)) (not (<= (+ v_main_~i~0_200 1) v_main_~i~0_199)))))) is different from false [2022-01-31 11:18:32,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_199 Int) (v_main_~i~0_200 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_480 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_200)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_480) (+ (* 8 v_main_~i~0_200) c_main_~a~0.offset) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= (+ v_main_~i~0_200 1) v_main_~i~0_199)))) is different from false [2022-01-31 11:18:34,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_201 Int)) (or (forall ((v_main_~i~0_199 Int) (v_main_~i~0_200 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_480 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ v_main_~i~0_201 1) v_main_~i~0_200)) (not (<= 1 v_main_~i~0_195)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_201)) v_ArrVal_480) (+ (* 8 v_main_~i~0_200) c_main_~a~0.offset) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (not (<= (+ v_main_~i~0_200 1) v_main_~i~0_199)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_201)))) is different from false [2022-01-31 11:18:36,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_201 Int) (v_main_~i~0_199 Int) (v_main_~i~0_200 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_480 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse1 .cse2 (+ (* (- 1) (* c_main_~i~0 c_main_~i~0)) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_201)) v_ArrVal_480) (+ (* 8 v_main_~i~0_200) c_main_~a~0.offset) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset)) (- 1)) (not (<= (+ v_main_~i~0_201 1) v_main_~i~0_200)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_201)) (not (<= (+ v_main_~i~0_200 1) v_main_~i~0_199)))) is different from false [2022-01-31 11:18:37,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_201 Int) (v_main_~i~0_199 Int) (v_main_~i~0_200 Int) (v_main_~i~0_198 Int) (v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_ArrVal_483 Int) (v_ArrVal_493 Int) (v_ArrVal_481 Int) (v_ArrVal_480 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= (+ v_main_~i~0_201 1) v_main_~i~0_200)) (not (<= 1 v_main_~i~0_195)) (= (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (select .cse1 c_main_~a~0.offset))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_201)) v_ArrVal_480) (+ (* 8 v_main_~i~0_200) c_main_~a~0.offset) v_ArrVal_481) (+ c_main_~a~0.offset (* 8 v_main_~i~0_199)) v_ArrVal_483) (+ c_main_~a~0.offset (* 8 v_main_~i~0_198)) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset)) (- 1)) (not (<= (+ v_main_~i~0_199 1) v_main_~i~0_198)) (not (<= 1 v_main_~i~0_201)) (not (<= (+ v_main_~i~0_200 1) v_main_~i~0_199)))) is different from false [2022-01-31 11:19:04,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_204 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_204)) (forall ((v_ArrVal_485 Int) (v_ArrVal_495 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))))) is different from false [2022-01-31 11:19:06,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_495 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int) (v_main_~i~0_204 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_473) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= 1 v_main_~i~0_195)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_204)))) is different from false [2022-01-31 11:19:08,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_205 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_205)) (forall ((v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_495 Int) (v_main_~i~0_195 Int) (v_ArrVal_493 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_192 Int) (v_main_~i~0_204 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_205 1) v_main_~i~0_204)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_205)) v_ArrVal_473) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= 1 v_main_~i~0_195)))))) is different from false [2022-01-31 11:19:49,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_206 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_206)) (forall ((v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_495 Int) (v_ArrVal_471 Int) (v_ArrVal_493 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_205 Int) (v_main_~i~0_204 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_205 1) v_main_~i~0_204)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_206 1) v_main_~i~0_205)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_206) c_main_~a~0.offset) v_ArrVal_471) (+ c_main_~a~0.offset (* 8 v_main_~i~0_205)) v_ArrVal_473) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))))) is different from false [2022-01-31 11:19:51,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_469 Int) (v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_495 Int) (v_ArrVal_471 Int) (v_ArrVal_493 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_205 Int) (v_main_~i~0_206 Int) (v_main_~i~0_204 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_206)) (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_205 1) v_main_~i~0_204)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_206 1) v_main_~i~0_205)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_469) (+ (* 8 v_main_~i~0_206) c_main_~a~0.offset) v_ArrVal_471) (+ c_main_~a~0.offset (* 8 v_main_~i~0_205)) v_ArrVal_473) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))))) is different from false [2022-01-31 11:19:54,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_207 Int)) (or (forall ((v_main_~i~0_195 Int) (v_main_~i~0_193 Int) (v_main_~i~0_194 Int) (v_main_~i~0_192 Int) (v_ArrVal_469 Int) (v_ArrVal_485 Int) (v_ArrVal_473 Int) (v_ArrVal_495 Int) (v_ArrVal_471 Int) (v_ArrVal_493 Int) (v_ArrVal_491 Int) (v_ArrVal_490 Int) (v_main_~i~0_205 Int) (v_main_~i~0_206 Int) (v_main_~i~0_204 Int)) (or (not (<= (+ v_main_~i~0_194 1) v_main_~i~0_193)) (not (<= (+ v_main_~i~0_205 1) v_main_~i~0_204)) (not (<= (+ v_main_~i~0_195 1) v_main_~i~0_194)) (not (<= (+ v_main_~i~0_193 1) v_main_~i~0_192)) (= (- 1) (+ (- 1) (select (store (store (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_207)) v_ArrVal_469) (+ (* 8 v_main_~i~0_206) c_main_~a~0.offset) v_ArrVal_471) (+ c_main_~a~0.offset (* 8 v_main_~i~0_205)) v_ArrVal_473) (+ (* 8 v_main_~i~0_204) c_main_~a~0.offset) v_ArrVal_485))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) 1))) (+ c_main_~a~0.offset (* 8 v_main_~i~0_195)) v_ArrVal_490) (+ c_main_~a~0.offset (* 8 v_main_~i~0_194)) v_ArrVal_491) (+ c_main_~a~0.offset (* 8 v_main_~i~0_193)) v_ArrVal_493) (+ c_main_~a~0.offset (* 8 v_main_~i~0_192)) v_ArrVal_495) c_main_~a~0.offset))) (not (<= 1 v_main_~i~0_195)) (not (<= (+ v_main_~i~0_207 1) v_main_~i~0_206)) (not (<= (+ v_main_~i~0_206 1) v_main_~i~0_205)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_207)))) is different from false [2022-01-31 11:19:54,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2022-01-31 11:19:54,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1395382 treesize of output 1391286 [2022-01-31 11:20:24,967 WARN L228 SmtUtils]: Spent 17.00s on a formula simplification. DAG size of input: 728 DAG size of output: 728 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)