/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/sina1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:48:52,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:48:52,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:48:52,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:48:52,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:48:52,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:48:52,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:48:52,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:48:52,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:48:52,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:48:52,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:48:52,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:48:52,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:48:52,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:48:52,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:48:52,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:48:52,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:48:52,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:48:52,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:48:52,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:48:52,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:48:52,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:48:52,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:48:52,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:48:52,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:48:52,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:48:52,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:48:52,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:48:52,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:48:52,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:48:52,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:48:52,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:48:52,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:48:52,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:48:52,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:48:52,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:48:52,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:48:52,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:48:52,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:48:52,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:48:52,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:48:52,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:48:52,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:48:52,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:48:52,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:48:52,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:48:52,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:48:52,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:48:52,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:48:52,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:48:52,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:48:52,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:48:52,996 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:48:52,996 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:48:53,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:48:53,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:48:53,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:48:53,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:48:53,269 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:48:53,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina1.c [2022-01-31 11:48:53,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f65c85/1a758879bbba48c0a91c0decd78ada7e/FLAGc04a7993d [2022-01-31 11:48:53,729 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:48:53,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina1.c [2022-01-31 11:48:53,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f65c85/1a758879bbba48c0a91c0decd78ada7e/FLAGc04a7993d [2022-01-31 11:48:54,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698f65c85/1a758879bbba48c0a91c0decd78ada7e [2022-01-31 11:48:54,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:48:54,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:48:54,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:48:54,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:48:54,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:48:54,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17511661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54, skipping insertion in model container [2022-01-31 11:48:54,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:48:54,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:48:54,301 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/sina1.c[588,601] [2022-01-31 11:48:54,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:48:54,342 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:48:54,350 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/sina1.c[588,601] [2022-01-31 11:48:54,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:48:54,369 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:48:54,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54 WrapperNode [2022-01-31 11:48:54,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:48:54,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:48:54,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:48:54,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:48:54,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:48:54,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:48:54,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:48:54,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:48:54,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:48:54,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:54,428 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:48:54,438 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:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:48:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:48:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:48:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:48:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:48:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:48:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:48:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:48:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:48:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:48:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:48:54,516 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:48:54,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:48:54,675 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:48:54,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:48:54,697 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:48:54,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:48:54 BoogieIcfgContainer [2022-01-31 11:48:54,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:48:54,699 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:48:54,699 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:48:54,700 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:48:54,702 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:48:54" (1/1) ... [2022-01-31 11:48:54,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:48:54 BasicIcfg [2022-01-31 11:48:54,725 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:48:54,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:48:54,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:48:54,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:48:54,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:48:54" (1/4) ... [2022-01-31 11:48:54,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e220d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:48:54, skipping insertion in model container [2022-01-31 11:48:54,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:48:54" (2/4) ... [2022-01-31 11:48:54,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e220d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:48:54, skipping insertion in model container [2022-01-31 11:48:54,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:48:54" (3/4) ... [2022-01-31 11:48:54,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e220d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:48:54, skipping insertion in model container [2022-01-31 11:48:54,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:48:54" (4/4) ... [2022-01-31 11:48:54,748 INFO L111 eAbstractionObserver]: Analyzing ICFG sina1.cJordan [2022-01-31 11:48:54,752 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:48:54,752 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:48:54,810 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:48:54,818 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:48:54,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:48:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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:48:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 11:48:54,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:54,849 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] [2022-01-31 11:48:54,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash 683153263, now seen corresponding path program 1 times [2022-01-31 11:48:54,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:54,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429738462] [2022-01-31 11:48:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:54,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,083 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:48:55,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:55,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429738462] [2022-01-31 11:48:55,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429738462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:48:55,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:48:55,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:48:55,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806294518] [2022-01-31 11:48:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:48:55,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:48:55,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:48:55,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:48:55,118 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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:48:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:55,188 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-01-31 11:48:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:48:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 22 [2022-01-31 11:48:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:55,201 INFO L225 Difference]: With dead ends: 34 [2022-01-31 11:48:55,201 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 11:48:55,203 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:48:55,207 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:55,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:48:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 11:48:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 11:48:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:48:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 11:48:55,239 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2022-01-31 11:48:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:55,240 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 11:48:55,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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:48:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 11:48:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 11:48:55,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:55,241 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] [2022-01-31 11:48:55,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:48:55,242 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash -530200526, now seen corresponding path program 1 times [2022-01-31 11:48:55,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170995026] [2022-01-31 11:48:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:55,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,398 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:48:55,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:55,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170995026] [2022-01-31 11:48:55,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170995026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:48:55,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:48:55,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:48:55,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360479594] [2022-01-31 11:48:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:48:55,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:48:55,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:48:55,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:48:55,402 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:48:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:55,474 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-01-31 11:48:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:48:55,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 22 [2022-01-31 11:48:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:55,476 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:48:55,477 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 11:48:55,477 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:48:55,478 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:55,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 31 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:48:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 11:48:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-01-31 11:48:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:48:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-01-31 11:48:55,521 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2022-01-31 11:48:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:55,522 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-01-31 11:48:55,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:48:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-01-31 11:48:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 11:48:55,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:55,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:48:55,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:48:55,523 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1319940884, now seen corresponding path program 1 times [2022-01-31 11:48:55,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215956649] [2022-01-31 11:48:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:55,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:48:56,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:56,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215956649] [2022-01-31 11:48:56,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215956649] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:56,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632964043] [2022-01-31 11:48:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:56,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:56,026 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:48:56,027 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:48:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:56,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:48:56,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:56,185 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:48:56,262 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:48:56,416 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 11:48:56,418 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 18 [2022-01-31 11:48:56,494 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:48:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:48:56,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:02,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632964043] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:02,841 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:02,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2022-01-31 11:49:02,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615287609] [2022-01-31 11:49:02,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:02,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:49:02,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:49:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=599, Unknown=3, NotChecked=0, Total=702 [2022-01-31 11:49:02,844 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:03,537 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-01-31 11:49:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:49:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-01-31 11:49:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:03,538 INFO L225 Difference]: With dead ends: 52 [2022-01-31 11:49:03,538 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:49:03,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=270, Invalid=1287, Unknown=3, NotChecked=0, Total=1560 [2022-01-31 11:49:03,540 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:03,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 132 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 470 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-01-31 11:49:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:49:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-01-31 11:49:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 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:49:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-31 11:49:03,549 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2022-01-31 11:49:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:03,550 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-31 11:49:03,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:49:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-31 11:49:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 11:49:03,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:03,551 INFO L514 BasicCegarLoop]: trace histogram [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:49:03,580 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:49:03,775 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:49:03,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1780810280, now seen corresponding path program 2 times [2022-01-31 11:49:03,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:03,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071634544] [2022-01-31 11:49:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:03,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:03,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071634544] [2022-01-31 11:49:03,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071634544] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:03,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139417624] [2022-01-31 11:49:03,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:49:03,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:03,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:03,867 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:49:03,869 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:49:03,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:49:03,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:03,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:03,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:04,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139417624] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:04,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:04,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:04,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775901323] [2022-01-31 11:49:04,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:04,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:04,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:04,082 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:04,298 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-01-31 11:49:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:04,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-31 11:49:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:04,301 INFO L225 Difference]: With dead ends: 67 [2022-01-31 11:49:04,301 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:49:04,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:49:04,302 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:04,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 78 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:49:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:49:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2022-01-31 11:49:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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:49:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-01-31 11:49:04,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 28 [2022-01-31 11:49:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:04,309 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-01-31 11:49:04,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-01-31 11:49:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:49:04,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:04,312 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:04,339 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:49:04,527 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:49:04,527 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 691408166, now seen corresponding path program 3 times [2022-01-31 11:49:04,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001290758] [2022-01-31 11:49:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:04,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:04,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001290758] [2022-01-31 11:49:04,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001290758] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956514710] [2022-01-31 11:49:04,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:49:04,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:04,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:04,852 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:49:04,854 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:49:04,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:49:04,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:04,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-31 11:49:04,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:04,946 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:49:04,986 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:49:05,012 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:49:05,088 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-31 11:49:05,089 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 22 [2022-01-31 11:49:05,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:05,181 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 28 treesize of output 27 [2022-01-31 11:49:05,341 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:49:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:05,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:41,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956514710] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:41,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:41,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2022-01-31 11:49:41,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225866048] [2022-01-31 11:49:41,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:41,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 11:49:41,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 11:49:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1334, Unknown=15, NotChecked=0, Total=1482 [2022-01-31 11:49:41,057 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 39 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:48,214 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-01-31 11:49:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:49:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 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:49:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:48,215 INFO L225 Difference]: With dead ends: 79 [2022-01-31 11:49:48,215 INFO L226 Difference]: Without dead ends: 76 [2022-01-31 11:49:48,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=415, Invalid=3227, Unknown=18, NotChecked=0, Total=3660 [2022-01-31 11:49:48,217 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:48,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 274 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 741 Invalid, 0 Unknown, 287 Unchecked, 0.4s Time] [2022-01-31 11:49:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-31 11:49:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-01-31 11:49:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 54 states have internal predecessors, (57), 7 states have call successors, (7), 6 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:49:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-01-31 11:49:48,224 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 30 [2022-01-31 11:49:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:48,225 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-01-31 11:49:48,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-01-31 11:49:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:49:48,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:48,226 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:49:48,253 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:49:48,450 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:49:48,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 192070754, now seen corresponding path program 4 times [2022-01-31 11:49:48,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:48,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939295331] [2022-01-31 11:49:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:48,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:48,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939295331] [2022-01-31 11:49:48,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939295331] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370869363] [2022-01-31 11:49:48,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:49:48,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:48,559 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:49:48,587 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:49:48,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:49:48,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:48,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:49:48,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:48,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:48,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370869363] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:48,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:48,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:49:48,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117711639] [2022-01-31 11:49:48,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:48,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:49:48,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:48,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:49:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:48,823 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:49,121 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-01-31 11:49:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:49:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-31 11:49:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:49,122 INFO L225 Difference]: With dead ends: 93 [2022-01-31 11:49:49,122 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 11:49:49,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:49:49,123 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:49,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 113 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:49:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 11:49:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2022-01-31 11:49:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 56 states have internal predecessors, (59), 7 states have call successors, (7), 6 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:49:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-31 11:49:49,131 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 32 [2022-01-31 11:49:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:49,131 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-31 11:49:49,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-31 11:49:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:49:49,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:49,132 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-01-31 11:49:49,159 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:49:49,339 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:49:49,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash 469914145, now seen corresponding path program 1 times [2022-01-31 11:49:49,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:49,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732602921] [2022-01-31 11:49:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:49,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:49,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:49,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 11:49:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:49,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732602921] [2022-01-31 11:49:49,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732602921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097250444] [2022-01-31 11:49:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:49,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:49,436 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:49:49,438 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:49:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:49,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:49:49,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:49,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:49:49,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097250444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:49,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:49,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:49:49,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332977718] [2022-01-31 11:49:49,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:49,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:49:49,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:49:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:49:49,668 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:49:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:49,827 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-01-31 11:49:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:49:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2022-01-31 11:49:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:49,829 INFO L225 Difference]: With dead ends: 78 [2022-01-31 11:49:49,829 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 11:49:49,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:49:49,829 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:49,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 65 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:49:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 11:49:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2022-01-31 11:49:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 6 states have call successors, (6), 5 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:49:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-01-31 11:49:49,835 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 34 [2022-01-31 11:49:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:49,835 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-01-31 11:49:49,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:49:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-01-31 11:49:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:49:49,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:49,836 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:49:49,861 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:49:50,036 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:49:50,037 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1373886240, now seen corresponding path program 5 times [2022-01-31 11:49:50,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:50,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578302990] [2022-01-31 11:49:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:50,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:49:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:49:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:49:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:50,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:50,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578302990] [2022-01-31 11:49:50,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578302990] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:49:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176580271] [2022-01-31 11:49:50,716 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:49:50,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:50,717 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:49:50,718 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:49:50,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:49:50,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:50,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 11:49:50,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:50,802 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:49:50,841 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:49:50,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 11:49:50,991 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:49:51,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:49:51,158 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-31 11:49:51,159 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 22 [2022-01-31 11:49:51,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:51,279 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:49:51,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:51,338 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:49:51,398 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:49:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:51,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:49:56,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176580271] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:56,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:49:56,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 50 [2022-01-31 11:49:56,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605660956] [2022-01-31 11:49:56,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:56,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 11:49:56,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 11:49:56,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2224, Unknown=2, NotChecked=0, Total=2450 [2022-01-31 11:49:56,703 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:00,383 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-01-31 11:50:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:50:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 3 states have call successors, (7), 4 states have call predecessors, (7), 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:50:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:00,385 INFO L225 Difference]: With dead ends: 83 [2022-01-31 11:50:00,385 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 11:50:00,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=399, Invalid=4153, Unknown=4, NotChecked=0, Total=4556 [2022-01-31 11:50:00,387 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:00,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 341 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 767 Invalid, 0 Unknown, 265 Unchecked, 0.4s Time] [2022-01-31 11:50:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 11:50:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-01-31 11:50:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.1) internal successors, (66), 62 states have internal predecessors, (66), 7 states have call successors, (7), 6 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:50:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-01-31 11:50:00,396 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 34 [2022-01-31 11:50:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:00,396 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-01-31 11:50:00,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-01-31 11:50:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 11:50:00,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:00,397 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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:50:00,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:00,625 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:50:00,625 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 678617628, now seen corresponding path program 6 times [2022-01-31 11:50:00,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547275867] [2022-01-31 11:50:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:00,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:00,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547275867] [2022-01-31 11:50:00,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547275867] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169967796] [2022-01-31 11:50:00,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:50:00,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:00,746 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:50:00,747 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:50:00,810 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:50:00,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:00,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:50:00,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:00,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:01,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169967796] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:01,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:01,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:50:01,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439374690] [2022-01-31 11:50:01,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:01,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:50:01,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:50:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:50:01,021 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:01,333 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-01-31 11:50:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:50:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 11:50:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:01,335 INFO L225 Difference]: With dead ends: 118 [2022-01-31 11:50:01,335 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 11:50:01,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:50:01,336 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:01,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 119 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:50:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 11:50:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2022-01-31 11:50:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.096774193548387) internal successors, (68), 64 states have internal predecessors, (68), 7 states have call successors, (7), 6 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:50:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-01-31 11:50:01,342 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 36 [2022-01-31 11:50:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:01,343 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-01-31 11:50:01,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-01-31 11:50:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:50:01,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:01,344 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:50:01,366 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:50:01,563 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:50:01,564 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2091268187, now seen corresponding path program 2 times [2022-01-31 11:50:01,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:01,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886070486] [2022-01-31 11:50:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:01,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 11:50:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:01,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886070486] [2022-01-31 11:50:01,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886070486] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849845176] [2022-01-31 11:50:01,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:50:01,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:01,966 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:50:01,967 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:50:02,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:50:02,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:02,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:50:02,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:02,056 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 10 treesize of output 8 [2022-01-31 11:50:02,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:50:02,132 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 19 treesize of output 19 [2022-01-31 11:50:02,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:02,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-01-31 11:50:03,085 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (and (= .cse0 (select .cse1 0)) (not (= v_main_~a~0.base_BEFORE_CALL_1 |main_~#sum~0.base|)) (= .cse0 (select .cse1 4))))) is different from true [2022-01-31 11:50:05,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 11:50:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-31 11:50:06,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:50:06,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849845176] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:06,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:06,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 15] total 42 [2022-01-31 11:50:06,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826298160] [2022-01-31 11:50:06,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:06,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 11:50:06,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 11:50:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1467, Unknown=4, NotChecked=78, Total=1722 [2022-01-31 11:50:06,980 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 42 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:50:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:12,134 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-01-31 11:50:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 11:50:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-01-31 11:50:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:12,135 INFO L225 Difference]: With dead ends: 96 [2022-01-31 11:50:12,136 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 11:50:12,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=314, Invalid=2872, Unknown=10, NotChecked=110, Total=3306 [2022-01-31 11:50:12,137 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:12,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 275 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 604 Invalid, 0 Unknown, 176 Unchecked, 0.3s Time] [2022-01-31 11:50:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 11:50:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-01-31 11:50:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.125) internal successors, (72), 67 states have internal predecessors, (72), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:50:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-01-31 11:50:12,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 38 [2022-01-31 11:50:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:12,153 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-01-31 11:50:12,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:50:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-01-31 11:50:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:50:12,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:12,154 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 11:50:12,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 11:50:12,367 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:50:12,367 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1953775590, now seen corresponding path program 7 times [2022-01-31 11:50:12,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:12,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800306668] [2022-01-31 11:50:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:12,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:12,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800306668] [2022-01-31 11:50:12,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800306668] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978793417] [2022-01-31 11:50:12,933 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:50:12,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:12,936 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:50:12,937 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:50:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:13,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-31 11:50:13,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:13,029 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:50:13,040 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:50:13,089 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 32 treesize of output 16 [2022-01-31 11:50:13,161 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 32 treesize of output 16 [2022-01-31 11:50:13,231 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 32 treesize of output 16 [2022-01-31 11:50:13,390 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-31 11:50:13,391 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 25 [2022-01-31 11:50:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:13,505 INFO L353 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2022-01-31 11:50:13,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2022-01-31 11:50:13,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:13,607 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 30 treesize of output 25 [2022-01-31 11:50:13,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:13,668 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 30 treesize of output 25 [2022-01-31 11:50:13,785 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 10 [2022-01-31 11:50:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:13,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:16,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_107 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_107)) (forall ((v_ArrVal_358 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset))))) is different from false [2022-01-31 11:50:21,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_357 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) is different from false [2022-01-31 11:51:10,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_357 Int) (v_ArrVal_355 Int) (v_main_~i~0_108 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_355) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) is different from false [2022-01-31 11:52:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 5 times theorem prover too weak. 3 trivial. 6 not checked. [2022-01-31 11:52:00,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978793417] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:52:00,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:52:00,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 21] total 61 [2022-01-31 11:52:00,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061390124] [2022-01-31 11:52:00,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:52:00,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-31 11:52:00,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:52:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-31 11:52:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2905, Unknown=67, NotChecked=342, Total=3660 [2022-01-31 11:52:00,700 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 61 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 58 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:07,650 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~N~0 4) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (<= .cse0 4) (<= 4 .cse0)))) (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_357 Int) (v_ArrVal_355 Int) (v_main_~i~0_108 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_355) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (< 3 c_~N~0)) is different from false [2022-01-31 11:52:09,689 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) c_~N~0) (forall ((v_main_~i~0_107 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_107)) (forall ((v_ArrVal_358 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)))))) is different from false [2022-01-31 11:52:11,691 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset))) (and (<= 1 c_main_~i~0) (<= c_~N~0 4) (<= .cse0 4) (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_357 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) (forall ((v_main_~i~0_107 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_107)) (forall ((v_ArrVal_358 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset))))) (= c_main_~a~0.offset 0) (< 3 c_~N~0) (<= 4 .cse0))) is different from false [2022-01-31 11:52:13,695 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_357 Int) (v_ArrVal_355 Int) (v_main_~i~0_108 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_355) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (<= 4 c_~N~0)) is different from false [2022-01-31 11:52:17,173 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset))) (and (<= c_~N~0 4) (<= .cse0 4) (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_357 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) (<= 2 c_main_~i~0) (forall ((v_main_~i~0_107 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_107)) (forall ((v_ArrVal_358 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset))))) (= c_main_~a~0.offset 0) (< 3 c_~N~0) (<= 4 .cse0))) is different from false [2022-01-31 11:52:19,176 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_357 Int) (v_main_~i~0_107 Int) (v_ArrVal_358 Int)) (or (not (<= (+ v_main_~i~0_108 1) v_main_~i~0_107)) (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_357) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) (forall ((v_main_~i~0_107 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_107)) (forall ((v_ArrVal_358 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_107) c_main_~a~0.offset) v_ArrVal_358) c_main_~a~0.offset))))) (= c_main_~a~0.offset 0) (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 0)) (<= (+ 4 (div (* (- 1) c_main_~a~0.offset) 4)) c_~N~0)) is different from false [2022-01-31 11:52:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:19,729 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-01-31 11:52:19,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 11:52:19,729 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 58 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 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:52:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:19,730 INFO L225 Difference]: With dead ends: 111 [2022-01-31 11:52:19,730 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 11:52:19,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 124.4s TimeCoverageRelationStatistics Valid=506, Invalid=4708, Unknown=78, NotChecked=1350, Total=6642 [2022-01-31 11:52:19,732 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:19,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 290 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 243 Unchecked, 0.1s Time] [2022-01-31 11:52:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 11:52:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2022-01-31 11:52:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 states have internal predecessors, (75), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:52:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-01-31 11:52:19,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 38 [2022-01-31 11:52:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:19,738 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-01-31 11:52:19,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 58 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:52:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-01-31 11:52:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 11:52:19,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:19,739 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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] [2022-01-31 11:52:19,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-31 11:52:19,955 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:52:19,955 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash -285806447, now seen corresponding path program 3 times [2022-01-31 11:52:19,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:19,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477483369] [2022-01-31 11:52:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:19,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 11:52:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:52:20,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477483369] [2022-01-31 11:52:20,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477483369] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247195665] [2022-01-31 11:52:20,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:52:20,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:20,088 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:52:20,109 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:52:20,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 11:52:20,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:52:20,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 11:52:20,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:52:20,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:52:20,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247195665] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:52:20,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:52:20,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-01-31 11:52:20,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754570729] [2022-01-31 11:52:20,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:52:20,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:52:20,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:52:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:52:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:52:20,456 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:52:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:20,791 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-01-31 11:52:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:52:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 11:52:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:20,792 INFO L225 Difference]: With dead ends: 151 [2022-01-31 11:52:20,792 INFO L226 Difference]: Without dead ends: 143 [2022-01-31 11:52:20,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 11:52:20,793 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 182 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:20,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 100 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:52:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-31 11:52:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2022-01-31 11:52:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 99 states have internal predecessors, (104), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 11:52:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2022-01-31 11:52:20,804 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 46 [2022-01-31 11:52:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:20,804 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2022-01-31 11:52:20,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:52:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-01-31 11:52:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:52:20,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:20,805 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:52:20,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:52:21,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 11:52:21,012 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 262260298, now seen corresponding path program 4 times [2022-01-31 11:52:21,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735282206] [2022-01-31 11:52:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:21,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 11:52:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 11:52:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:52:21,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:21,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735282206] [2022-01-31 11:52:21,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735282206] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:21,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657220983] [2022-01-31 11:52:21,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:52:21,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:21,492 INFO L229 MonitoredProcess]: Starting monitored process 12 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:52:21,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 11:52:21,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:52:21,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:52:21,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 11:52:21,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:21,573 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:52:21,603 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:52:21,664 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 27 treesize of output 15 [2022-01-31 11:52:21,730 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:52:21,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:21,882 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 22 [2022-01-31 11:52:22,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:22,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:22,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-31 11:52:22,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:22,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:22,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-01-31 11:52:22,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:52:22,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-01-31 11:52:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:52:22,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 11:52:24,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657220983] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:52:24,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:52:24,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 19] total 58 [2022-01-31 11:52:24,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518559018] [2022-01-31 11:52:24,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:52:24,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 11:52:24,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:52:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 11:52:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3016, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 11:52:24,038 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 58 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 56 states have internal predecessors, (92), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:52:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:52:26,341 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-01-31 11:52:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 11:52:26,341 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 56 states have internal predecessors, (92), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 50 [2022-01-31 11:52:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:52:26,342 INFO L225 Difference]: With dead ends: 119 [2022-01-31 11:52:26,342 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 11:52:26,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2365 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=600, Invalid=6882, Unknown=0, NotChecked=0, Total=7482 [2022-01-31 11:52:26,344 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:52:26,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 380 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 614 Invalid, 0 Unknown, 397 Unchecked, 0.3s Time] [2022-01-31 11:52:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 11:52:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-01-31 11:52:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.082191780821918) internal successors, (79), 75 states have internal predecessors, (79), 9 states have call successors, (9), 8 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:52:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-01-31 11:52:26,348 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 50 [2022-01-31 11:52:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:52:26,348 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-01-31 11:52:26,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 56 states have internal predecessors, (92), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:52:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-01-31 11:52:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:52:26,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:52:26,349 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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:52:26,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 11:52:26,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 11:52:26,563 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:52:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:52:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2042728457, now seen corresponding path program 5 times [2022-01-31 11:52:26,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:52:26,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806755271] [2022-01-31 11:52:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:52:26,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:52:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:52:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:52:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 11:52:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:52:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:52:27,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:52:27,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806755271] [2022-01-31 11:52:27,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806755271] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:52:27,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278272095] [2022-01-31 11:52:27,360 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:52:27,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:52:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:52:27,364 INFO L229 MonitoredProcess]: Starting monitored process 13 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:52:27,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 11:52:27,460 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:52:27,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:52:27,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-31 11:52:27,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:52:27,490 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 10 treesize of output 8 [2022-01-31 11:52:27,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:52:27,519 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 13 [2022-01-31 11:52:27,550 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 15 [2022-01-31 11:52:27,581 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 13 [2022-01-31 11:52:27,623 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 15 [2022-01-31 11:52:27,664 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 15 [2022-01-31 11:52:27,735 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 14 treesize of output 16 [2022-01-31 11:52:27,781 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 22 [2022-01-31 11:52:27,885 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:52:27,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-01-31 11:52:27,948 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:52:27,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-01-31 11:52:28,015 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:52:28,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-01-31 11:52:28,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-31 11:52:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:52:28,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:30,289 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 Int) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= (select (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ .cse0 main_~a~0.offset 4) v_ArrVal_529) (+ .cse0 main_~a~0.offset 8) v_ArrVal_530) (+ .cse0 main_~a~0.offset 12) v_ArrVal_532)) (+ main_~a~0.offset 4)) (+ c_main_~i~0 4))) (forall ((v_ArrVal_532 Int) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= (+ c_main_~i~0 4) (select (let ((.cse1 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ .cse1 main_~a~0.offset 4) v_ArrVal_529) (+ .cse1 main_~a~0.offset 8) v_ArrVal_530) (+ .cse1 main_~a~0.offset 12) v_ArrVal_532)) (+ main_~a~0.offset 4))))) is different from false [2022-01-31 11:53:04,537 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 Int) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= (select (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store v_ArrVal_525 (+ .cse0 main_~a~0.offset 4) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_525) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ .cse0 main_~a~0.offset 8) v_ArrVal_529) (+ .cse0 main_~a~0.offset 12) v_ArrVal_530) (+ .cse0 main_~a~0.offset 16) v_ArrVal_532)) (+ main_~a~0.offset 4)) (+ c_main_~i~0 5))) (forall ((v_ArrVal_532 Int) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= (+ c_main_~i~0 5) (select (let ((.cse1 (* c_main_~i~0 4))) (store (store (store (store v_ArrVal_525 (+ .cse1 main_~a~0.offset 4) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_525) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ .cse1 main_~a~0.offset 8) v_ArrVal_529) (+ .cse1 main_~a~0.offset 12) v_ArrVal_530) (+ .cse1 main_~a~0.offset 16) v_ArrVal_532)) (+ main_~a~0.offset 4))))) is different from false [2022-01-31 11:53:04,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 Int) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= (let ((.cse0 (+ main_~a~0.offset 4))) (select (store (store (store (store v_ArrVal_525 .cse0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_525) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset 8) v_ArrVal_529) (+ main_~a~0.offset 12) v_ArrVal_530) (+ main_~a~0.offset 16) v_ArrVal_532) .cse0)) 5)) (forall ((v_ArrVal_532 Int) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_530 Int) (main_~a~0.offset Int) (v_ArrVal_529 Int)) (<= 5 (let ((.cse1 (+ main_~a~0.offset 4))) (select (store (store (store (store v_ArrVal_525 .cse1 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_525) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset 8) v_ArrVal_529) (+ main_~a~0.offset 12) v_ArrVal_530) (+ main_~a~0.offset 16) v_ArrVal_532) .cse1))))) is different from false [2022-01-31 11:53:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-01-31 11:53:04,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278272095] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:04,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:04,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 25] total 65 [2022-01-31 11:53:04,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260570683] [2022-01-31 11:53:04,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:04,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-31 11:53:04,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:04,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-31 11:53:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3547, Unknown=21, NotChecked=366, Total=4160 [2022-01-31 11:53:04,677 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 65 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 62 states have internal predecessors, (97), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:53:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:12,012 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-01-31 11:53:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 11:53:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 62 states have internal predecessors, (97), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-01-31 11:53:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:12,013 INFO L225 Difference]: With dead ends: 164 [2022-01-31 11:53:12,013 INFO L226 Difference]: Without dead ends: 164 [2022-01-31 11:53:12,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=651, Invalid=9236, Unknown=25, NotChecked=594, Total=10506 [2022-01-31 11:53:12,016 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 642 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:12,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 471 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 980 Invalid, 0 Unknown, 642 Unchecked, 0.4s Time] [2022-01-31 11:53:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-31 11:53:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2022-01-31 11:53:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 106 states have internal predecessors, (112), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 11:53:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-01-31 11:53:12,021 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 50 [2022-01-31 11:53:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:12,022 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-01-31 11:53:12,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 62 states have internal predecessors, (97), 6 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:53:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-01-31 11:53:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 11:53:12,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:12,023 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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:53:12,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:12,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 11:53:12,239 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 671105543, now seen corresponding path program 6 times [2022-01-31 11:53:12,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:12,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383649081] [2022-01-31 11:53:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:12,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:53:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:53:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 11:53:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:53:12,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383649081] [2022-01-31 11:53:12,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383649081] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:53:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316878078] [2022-01-31 11:53:12,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:53:12,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:12,378 INFO L229 MonitoredProcess]: Starting monitored process 14 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:53:12,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 11:53:12,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 11:53:12,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:12,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:53:12,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:53:12,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:53:12,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316878078] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:12,730 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:12,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 11:53:12,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67766487] [2022-01-31 11:53:12,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:12,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:53:12,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:53:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:53:12,731 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:53:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:13,088 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2022-01-31 11:53:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 11:53:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 11:53:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:13,089 INFO L225 Difference]: With dead ends: 174 [2022-01-31 11:53:13,089 INFO L226 Difference]: Without dead ends: 171 [2022-01-31 11:53:13,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 11:53:13,090 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 249 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:13,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 113 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:53:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-31 11:53:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2022-01-31 11:53:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 115 states have internal predecessors, (122), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 11:53:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-01-31 11:53:13,096 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 52 [2022-01-31 11:53:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:13,096 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-01-31 11:53:13,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 11:53:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-01-31 11:53:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:53:13,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:13,097 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:53:13,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:13,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 11:53:13,307 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1484805756, now seen corresponding path program 7 times [2022-01-31 11:53:13,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:13,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997330723] [2022-01-31 11:53:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:13,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:53:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:53:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 11:53:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 11:53:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:53:13,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997330723] [2022-01-31 11:53:13,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997330723] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:53:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157586272] [2022-01-31 11:53:13,871 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:53:13,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:13,876 INFO L229 MonitoredProcess]: Starting monitored process 15 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:53:13,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 11:53:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:13,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-31 11:53:13,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:13,987 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:53:14,019 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:53:14,091 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 27 treesize of output 15 [2022-01-31 11:53:14,170 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:53:14,239 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:53:14,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,395 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 24 [2022-01-31 11:53:14,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-01-31 11:53:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-01-31 11:53:14,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:14,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-01-31 11:53:15,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:15,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 11:53:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:53:15,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:54:08,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_211 Int) (v_ArrVal_655 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_211)))) is different from false [2022-01-31 11:54:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 25 refuted. 1 times theorem prover too weak. 13 trivial. 4 not checked. [2022-01-31 11:54:37,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157586272] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:54:37,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:54:37,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 21] total 66 [2022-01-31 11:54:37,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144131087] [2022-01-31 11:54:37,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:54:37,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 11:54:37,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:54:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 11:54:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3755, Unknown=52, NotChecked=126, Total=4290 [2022-01-31 11:54:37,617 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 66 states, 63 states have (on average 1.619047619047619) internal successors, (102), 64 states have internal predecessors, (102), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:54:39,359 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (forall ((v_main_~i~0_211 Int) (v_ArrVal_655 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_211)) (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8))))) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 4 (div (* (- 1) c_main_~a~0.offset) 4)) c_~N~0)) is different from false [2022-01-31 11:54:39,888 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (<= (+ c_main_~i~0 4) c_~N~0)) (<= c_main_~i~0 2) (forall ((v_main_~i~0_211 Int) (v_ArrVal_655 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_211)))) (<= 4 c_~N~0)) is different from false [2022-01-31 11:54:41,916 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_main_~i~0 4)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (select .cse2 c_main_~a~0.offset)) (.cse3 (+ .cse5 c_main_~a~0.offset))) (and (forall ((v_main_~i~0_211 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_211)) (forall ((v_ArrVal_655 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8)))))) (<= c_~N~0 4) (= (+ (- 1) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) 3) (= c_main_~i~0 3) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_211 Int) (v_ArrVal_650 Int) (v_ArrVal_655 Int)) (or (not (<= (+ c_main_~i~0 3) v_main_~i~0_211)) (= (select (store (let ((.cse1 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset 4) v_ArrVal_650))) (store .cse0 (+ .cse1 c_main_~a~0.offset 8) (select (select (store |c_#memory_int| c_main_~a~0.base .cse0) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8)) c_~N~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (= c_~N~0 (select .cse2 .cse3)) (= 3 (+ .cse4 (- 1))) (= .cse4 (select .cse2 (+ c_main_~a~0.offset 8))) (< 3 c_~N~0) (or (<= (+ .cse5 5 c_main_~a~0.offset) (* c_~N~0 4)) (and (not (= .cse3 8)) (= (select .cse2 0) (select .cse2 8)) (not (= .cse3 0)))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|)))))) is different from false [2022-01-31 11:54:43,920 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_211 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_211)) (forall ((v_ArrVal_655 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (let ((.cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (or (not (= .cse0 8)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (= (select .cse1 0) (select .cse1 .cse0))) (<= (+ c_main_~i~0 4) c_~N~0))) (<= c_main_~i~0 2) (<= 4 c_~N~0)) is different from false [2022-01-31 11:54:44,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse2 (select .cse3 c_main_~a~0.offset))) (and (<= c_~N~0 4) (forall ((v_main_~i~0_211 Int) (v_ArrVal_650 Int) (v_ArrVal_655 Int)) (or (= c_~N~0 (select (store (let ((.cse1 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset) v_ArrVal_650))) (store .cse0 (+ .cse1 c_main_~a~0.offset 4) (select (select (store |c_#memory_int| c_main_~a~0.base .cse0) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8))) (not (<= (+ c_main_~i~0 2) v_main_~i~0_211)))) (= c_main_~a~0.offset 0) (= 3 (+ .cse2 (- 1))) (= .cse2 (select .cse3 (+ c_main_~a~0.offset 8))) (forall ((v_main_~i~0_211 Int) (v_ArrVal_655 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_211)) v_ArrVal_655) (+ c_main_~a~0.offset 8))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_211)))) (< 3 c_~N~0) (forall ((v_ArrVal_655 Int)) (= c_~N~0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_655) (+ c_main_~a~0.offset 8)))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|)))))) is different from false [2022-01-31 11:54:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:54:52,035 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-01-31 11:54:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-31 11:54:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.619047619047619) internal successors, (102), 64 states have internal predecessors, (102), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 54 [2022-01-31 11:54:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:54:52,036 INFO L225 Difference]: With dead ends: 159 [2022-01-31 11:54:52,036 INFO L226 Difference]: Without dead ends: 159 [2022-01-31 11:54:52,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 97.1s TimeCoverageRelationStatistics Valid=736, Invalid=8346, Unknown=62, NotChecked=1158, Total=10302 [2022-01-31 11:54:52,037 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:54:52,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 372 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 504 Invalid, 0 Unknown, 399 Unchecked, 0.2s Time] [2022-01-31 11:54:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-01-31 11:54:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2022-01-31 11:54:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.087719298245614) internal successors, (124), 116 states have internal predecessors, (124), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 11:54:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2022-01-31 11:54:52,042 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 54 [2022-01-31 11:54:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:54:52,043 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2022-01-31 11:54:52,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.619047619047619) internal successors, (102), 64 states have internal predecessors, (102), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 11:54:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2022-01-31 11:54:52,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 11:54:52,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:54:52,044 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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:54:52,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 11:54:52,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:54:52,251 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:54:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:54:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1298768963, now seen corresponding path program 8 times [2022-01-31 11:54:52,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:54:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348234739] [2022-01-31 11:54:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:54:52,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:54:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:54:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:54:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 11:54:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:54:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:54:53,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:54:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348234739] [2022-01-31 11:54:53,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348234739] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:54:53,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308375450] [2022-01-31 11:54:53,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:54:53,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:54:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:54:53,016 INFO L229 MonitoredProcess]: Starting monitored process 16 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:54:53,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 11:54:53,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:54:53,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:54:53,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-31 11:54:53,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:54:53,106 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 10 treesize of output 8 [2022-01-31 11:54:53,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:54:53,204 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 19 treesize of output 19 [2022-01-31 11:54:53,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-01-31 11:54:53,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2022-01-31 11:54:53,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2022-01-31 11:54:53,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2022-01-31 11:54:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:54:53,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2022-01-31 11:54:54,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 11:54:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 11:54:54,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:56:06,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))))))) is different from false [2022-01-31 11:56:08,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))))) is different from false [2022-01-31 11:57:35,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) is different from false [2022-01-31 11:57:37,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))))) is different from false [2022-01-31 11:57:39,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_main_~i~0_232 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) is different from false [2022-01-31 12:00:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 11 refuted. 1 times theorem prover too weak. 36 trivial. 24 not checked. [2022-01-31 12:00:21,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308375450] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:00:21,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:00:21,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22, 23] total 68 [2022-01-31 12:00:21,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413315931] [2022-01-31 12:00:21,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:00:21,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 12:00:21,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:00:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 12:00:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3461, Unknown=143, NotChecked=630, Total=4556 [2022-01-31 12:00:21,325 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 68 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 65 states have internal predecessors, (101), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 12:00:38,437 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4)) (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset 1) (* c_~N~0 4))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse1 (select .cse2 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse2 c_main_~a~0.offset) .cse1)))) (= c_main_~i~0 1)) is different from false [2022-01-31 12:00:42,498 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_730 Int) (v_main_~i~0_232 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (<= 2 c_main_~i~0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse1 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse1 (+ c_main_~a~0.offset 4)) (select .cse1 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse2 (+ c_main_~a~0.offset 4)) .cse3) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse2 c_main_~a~0.offset) .cse3))))) is different from false [2022-01-31 12:00:44,512 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse0 (+ c_main_~a~0.offset 4)) .cse1) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse0 c_main_~a~0.offset) .cse1)))) (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse2 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse2 c_main_~a~0.offset) (select .cse2 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230))))))) is different from false [2022-01-31 12:00:48,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse1 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse1 c_main_~a~0.offset) (select .cse1 (+ c_main_~a~0.offset 4)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse2 (+ c_main_~a~0.offset 4)) .cse3) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse2 c_main_~a~0.offset) .cse3)))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 12:00:52,667 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2)))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 12:00:54,682 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse7 (+ .cse2 c_main_~a~0.offset)) (.cse6 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (<= 6 c_~N~0)) (.cse0 (= c_~N~0 (select .cse6 4))) (.cse1 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) (.cse3 (* c_~N~0 4)) (.cse5 (= .cse7 4))) (and (or (and .cse0 (<= (+ .cse1 1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 17) .cse3)) (= c_~N~0 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) .cse4 (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (and .cse0 (<= (+ 3 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 9) .cse3)) (or (and (<= c_main_~i~0 1) .cse4) .cse5) (or (and .cse0 (<= (+ 2 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 13) .cse3)) (or (not .cse5) (= c_~N~0 (select .cse6 .cse7))) (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse8 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse8 c_main_~a~0.offset) (select .cse8 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse9 (select .cse10 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse10 c_main_~a~0.offset) .cse9)))) (= c_main_~i~0 1))))) is different from false [2022-01-31 12:00:56,693 WARN L838 $PredicateComparison]: unable to prove that (and (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2))))) is different from false [2022-01-31 12:00:58,702 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4))) (.cse1 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) (.cse2 (* c_main_~i~0 4)) (.cse3 (* c_~N~0 4))) (and (or (and .cse0 (<= (+ .cse1 1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 17) .cse3)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_232 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse4 (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse4 c_main_~a~0.offset) (select .cse4 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (<= 2 c_main_~i~0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse5 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse5 (+ c_main_~a~0.offset 4)) (select .cse5 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (and .cse0 (<= (+ 3 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 9) .cse3)) (or (and .cse0 (<= (+ 2 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 13) .cse3)) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base)) (.cse7 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse6 (+ c_main_~a~0.offset 4)) .cse7) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse6 c_main_~a~0.offset) .cse7)))))) is different from false [2022-01-31 12:01:00,707 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4))) (.cse1 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) (.cse2 (* c_main_~i~0 4)) (.cse3 (* c_~N~0 4))) (and (or (and .cse0 (<= (+ .cse1 1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 17) .cse3)) (<= 2 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (and .cse0 (<= (+ 3 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 9) .cse3)) (or (and .cse0 (<= (+ 2 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 13) .cse3)) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse5 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse4 (+ c_main_~a~0.offset 4)) .cse5) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse4 c_main_~a~0.offset) .cse5)))) (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse6 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse6 c_main_~a~0.offset) (select .cse6 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))))))) is different from false [2022-01-31 12:01:01,809 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4))) (.cse2 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) (.cse3 (* c_main_~i~0 4)) (.cse4 (* c_~N~0 4))) (and (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (and .cse1 (<= (+ 3 .cse2) c_main_~i~0)) (<= (+ .cse3 c_main_~a~0.offset 9) .cse4)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse5 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse5 c_main_~a~0.offset) (select .cse5 (+ c_main_~a~0.offset 4)))))) (or (and .cse1 (<= (+ 2 .cse2) c_main_~i~0)) (<= (+ .cse3 c_main_~a~0.offset 13) .cse4)) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base)) (.cse7 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse6 (+ c_main_~a~0.offset 4)) .cse7) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse6 c_main_~a~0.offset) .cse7)))) (<= 3 c_main_~i~0))) is different from false [2022-01-31 12:01:03,820 WARN L838 $PredicateComparison]: unable to prove that (and (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2))))) is different from false [2022-01-31 12:01:05,824 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4))) (.cse1 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) (.cse2 (* c_main_~i~0 4)) (.cse3 (* c_~N~0 4))) (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (and .cse0 (<= (+ 3 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 9) .cse3)) (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse4 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse4 (+ c_main_~a~0.offset 4)) (select .cse4 c_main_~a~0.offset))))))) (or (and .cse0 (<= (+ 2 .cse1) c_main_~i~0)) (<= (+ .cse2 c_main_~a~0.offset 13) .cse3)) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse5 (+ c_main_~a~0.offset 4)) .cse6) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse5 c_main_~a~0.offset) .cse6)))) (<= 3 c_main_~i~0))) is different from false [2022-01-31 12:01:06,456 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (or (and (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4)) (<= (+ 3 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0)) (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset 9) (* c_~N~0 4))) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse0 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2))))) is different from false [2022-01-31 12:01:10,500 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (or (and (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4)) (<= (+ 3 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0)) (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset 9) (* c_~N~0 4))) (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2))))) is different from false [2022-01-31 12:01:23,277 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~N~0 (select (select |c_#memory_int| c_main_~a~0.base) 4)) (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset 1) (* c_~N~0 4))) (forall ((v_ArrVal_730 Int) (v_main_~i~0_232 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (<= 5 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse1 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse1 c_main_~a~0.offset) (select .cse1 (+ c_main_~a~0.offset 4)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse2 (+ c_main_~a~0.offset 4)) .cse3) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse2 c_main_~a~0.offset) .cse3))))) is different from false [2022-01-31 12:01:27,366 WARN L838 $PredicateComparison]: unable to prove that (and (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_230 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2)))) (forall ((v_main_~i~0_232 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (let ((.cse3 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse3 c_main_~a~0.offset) (select .cse3 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230))))))) is different from false [2022-01-31 12:01:31,455 WARN L838 $PredicateComparison]: unable to prove that (and (<= 5 c_main_~i~0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 (+ c_main_~a~0.offset 4)) (select .cse0 c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse1 (+ c_main_~a~0.offset 4)) .cse2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse1 c_main_~a~0.offset) .cse2))))) is different from false [2022-01-31 12:01:33,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_730 Int) (v_main_~i~0_232 Int) (v_main_~i~0_230 Int) (v_main_~i~0_231 Int) (v_ArrVal_728 Int) (v_ArrVal_726 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_232)) (not (<= (+ v_main_~i~0_232 1) v_main_~i~0_231)) (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (let ((.cse0 (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ c_main_~a~0.offset (* 4 v_main_~i~0_232)) v_ArrVal_726) (+ c_main_~a~0.offset (* 4 v_main_~i~0_231)) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse0 c_main_~a~0.offset) (select .cse0 (+ c_main_~a~0.offset 4)))) (not (<= (+ v_main_~i~0_231 1) v_main_~i~0_230)))) (<= 5 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_ArrVal_730 Int) (v_main_~i~0_230 Int) (v_ArrVal_728 Int) (v_main_~i~0_229 Int) (v_ArrVal_732 Int)) (or (not (<= (+ v_main_~i~0_230 1) v_main_~i~0_229)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_230)) (let ((.cse1 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_728) (+ (* 4 v_main_~i~0_230) c_main_~a~0.offset) v_ArrVal_730) (+ (* 4 v_main_~i~0_229) c_main_~a~0.offset) v_ArrVal_732))) (= (select .cse1 c_main_~a~0.offset) (select .cse1 (+ c_main_~a~0.offset 4)))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= (select .cse2 (+ c_main_~a~0.offset 4)) .cse3) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select .cse2 c_main_~a~0.offset) .cse3))))) is different from false [2022-01-31 12:01:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:39,096 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2022-01-31 12:01:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-31 12:01:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 65 states have internal predecessors, (101), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2022-01-31 12:01:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:39,098 INFO L225 Difference]: With dead ends: 168 [2022-01-31 12:01:39,098 INFO L226 Difference]: Without dead ends: 168 [2022-01-31 12:01:39,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 404.8s TimeCoverageRelationStatistics Valid=634, Invalid=6930, Unknown=184, NotChecked=4462, Total=12210 [2022-01-31 12:01:39,100 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 453 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:39,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 431 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 901 Invalid, 0 Unknown, 453 Unchecked, 0.4s Time] [2022-01-31 12:01:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-31 12:01:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2022-01-31 12:01:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.084033613445378) internal successors, (129), 120 states have internal predecessors, (129), 15 states have call successors, (15), 13 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 12:01:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2022-01-31 12:01:39,105 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 54 [2022-01-31 12:01:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:39,105 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2022-01-31 12:01:39,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 65 states have internal predecessors, (101), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 12:01:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2022-01-31 12:01:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 12:01:39,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:39,106 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:01:39,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 12:01:39,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 12:01:39,328 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1262364734, now seen corresponding path program 9 times [2022-01-31 12:01:39,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:39,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475226665] [2022-01-31 12:01:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:39,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:01:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:01:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 12:01:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 12:01:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:01:40,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:40,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475226665] [2022-01-31 12:01:40,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475226665] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:01:40,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783643454] [2022-01-31 12:01:40,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:01:40,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:01:40,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:40,020 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:01:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 12:01:40,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 12:01:40,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:01:40,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-31 12:01:40,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:01:40,158 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 12:01:40,189 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 12:01:40,253 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 27 treesize of output 15 [2022-01-31 12:01:40,316 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 27 treesize of output 15 [2022-01-31 12:01:40,387 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 12:01:40,462 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 27 treesize of output 15 [2022-01-31 12:01:40,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:40,635 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 14 treesize of output 16 [2022-01-31 12:01:40,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:40,699 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 14 treesize of output 16 [2022-01-31 12:01:40,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:40,764 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 20 [2022-01-31 12:01:40,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:40,852 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 12:01:40,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2022-01-31 12:01:41,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:41,010 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 12:01:41,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2022-01-31 12:01:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-01-31 12:01:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 12:01:42,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:01:43,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_250 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_803) (+ c_main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ c_main_~a~0.offset 8))) (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ main_~i~0 1))))) is different from false [2022-01-31 12:01:45,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (< (+ v_main_~i~0_250 1) c_~N~0) (= c_~N~0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) main_~a~0.offset) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ main_~a~0.offset 8))) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:47,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (= c_~N~0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) main_~a~0.offset 4) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ main_~a~0.offset 8))) (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:47,638 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_main_~i~0_252 Int) (v_main_~i~0_250 Int) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (= (select (store (store (store v_ArrVal_800 (+ (* c_main_~i~0 4) main_~a~0.offset 4) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ main_~a~0.offset 8)) c_~N~0))) is different from false [2022-01-31 12:01:47,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_main_~i~0_252 Int) (v_main_~i~0_250 Int) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (= c_~N~0 (select (store (store (store v_ArrVal_800 (+ (* c_main_~i~0 4) main_~a~0.offset 8) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ main_~a~0.offset 8))))) is different from false [2022-01-31 12:01:47,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_main_~i~0_252 Int) (v_main_~i~0_250 Int) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (= c_~N~0 (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0))))) is different from false [2022-01-31 12:01:49,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (let ((.cse2 (<= (+ v_main_~i~0_250 1) c_main_~i~0))) (and (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) 1)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0)) (+ c_main_~i~0 1))) .cse2) (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 1) (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 1)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)))) .cse2))) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:49,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (let ((.cse0 (<= v_main_~i~0_250 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 2) (let ((.cse1 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse1 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select .cse2 |c_main_~#sum~0.offset|) 1)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse1))))) (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 1)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)) (+ c_main_~i~0 2)))))) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:51,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (let ((.cse2 (<= v_main_~i~0_250 c_main_~i~0))) (and (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) 2)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0)) (+ c_main_~i~0 2))) .cse2) (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 2) (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 2)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)))) .cse2))))) is different from false [2022-01-31 12:01:53,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (let ((.cse0 (<= v_main_~i~0_250 (+ c_main_~i~0 1)))) (and (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse1 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse1 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select .cse2 |c_main_~#sum~0.offset|) 2)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse1)) (+ c_main_~i~0 3)))) (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 3) (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 2)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3))))))) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:55,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (let ((.cse0 (<= v_main_~i~0_250 (+ c_main_~i~0 1)))) (and (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse1 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse1 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select .cse2 |c_main_~#sum~0.offset|) 3)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse1)) (+ c_main_~i~0 3)))) (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 3) (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 3)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3))))))))) is different from false [2022-01-31 12:01:57,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (let ((.cse2 (<= v_main_~i~0_250 (+ c_main_~i~0 2)))) (and (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) 3)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0)) (+ c_main_~i~0 4))) .cse2) (or .cse2 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 4) (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 3)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3))))))))) is different from false [2022-01-31 12:01:57,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (let ((.cse2 (<= v_main_~i~0_250 (+ c_main_~i~0 2)))) (and (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 4) (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) 4)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0)))) .cse2) (or .cse2 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 4)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)) (+ c_main_~i~0 4)))))) (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))))) is different from false [2022-01-31 12:01:59,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (let ((.cse2 (<= v_main_~i~0_250 (+ c_main_~i~0 3)))) (and (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 5) (let ((.cse0 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse0 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse1 |c_main_~#sum~0.offset|) 4)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse0)))) .cse2) (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 4)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)) (+ c_main_~i~0 5))) .cse2))))) is different from false [2022-01-31 12:02:01,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_252 Int) (v_main_~i~0_250 Int)) (or (not (<= v_main_~i~0_250 (+ v_main_~i~0_252 1))) (let ((.cse0 (<= v_main_~i~0_250 (+ c_main_~i~0 3)))) (and (or .cse0 (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (+ c_main_~i~0 5) (let ((.cse1 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse1 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse2 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (+ (select .cse2 |c_main_~#sum~0.offset|) 5)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse1))))) (or (forall ((v_ArrVal_800 (Array Int Int)) (main_~a~0.offset Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (<= (let ((.cse3 (+ main_~a~0.offset 8))) (select (store (store (store v_ArrVal_800 .cse3 (select (select (store (store |c_#memory_int| |c_main_~#sum~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#sum~0.base|))) (store .cse4 |c_main_~#sum~0.offset| (+ (select .cse4 |c_main_~#sum~0.offset|) 5)))) c_main_~a~0.base v_ArrVal_800) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (+ main_~a~0.offset (* 4 v_main_~i~0_252)) v_ArrVal_803) (+ main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) .cse3)) (+ c_main_~i~0 5))) .cse0))))) is different from false [2022-01-31 12:02:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 48 not checked. [2022-01-31 12:02:01,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783643454] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:02:01,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:02:01,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 30] total 80 [2022-01-31 12:02:01,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396589957] [2022-01-31 12:02:01,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:02:01,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-31 12:02:01,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:02:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-31 12:02:01,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3828, Unknown=18, NotChecked=2100, Total=6320 [2022-01-31 12:02:01,833 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 80 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 78 states have internal predecessors, (118), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 12:02:07,993 WARN L228 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 74 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:20,665 WARN L228 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 74 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:37,795 WARN L228 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 63 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:45,707 WARN L228 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 57 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:46,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= 5 c_~N~0) (forall ((main_~i~0 Int) (v_main_~i~0_250 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_803) (+ c_main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ c_main_~a~0.offset 8))) (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ main_~i~0 1))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (<= 2 c_main_~i~0) (< 4 c_~N~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select .cse0 (+ c_main_~a~0.offset 8)) 5) (<= c_main_~i~0 2) (let ((.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (or (not (= .cse1 8)) (= (select .cse0 0) (select .cse0 .cse1)) (<= (+ c_main_~i~0 5) c_~N~0))) (<= c_~N~0 5))) is different from false [2022-01-31 12:02:47,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (forall ((main_~i~0 Int) (v_main_~i~0_250 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int)) (or (= c_~N~0 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_803) (+ c_main_~a~0.offset (* 4 v_main_~i~0_250)) v_ArrVal_805) (+ c_main_~a~0.offset 8))) (< (+ v_main_~i~0_250 1) c_~N~0) (not (<= v_main_~i~0_250 (+ main_~i~0 1))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (< 4 c_~N~0) (or (and (= (select .cse0 0) (select .cse0 8)) (<= (+ 5 (div (* (- 1) c_main_~a~0.offset) 4)) c_~N~0)) (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset 9) (* c_~N~0 4))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select .cse0 (+ c_main_~a~0.offset 8)) 5) (<= c_~N~0 5))) is different from false [2022-01-31 12:03:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:03:07,597 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2022-01-31 12:03:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-01-31 12:03:07,597 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 78 states have internal predecessors, (118), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-01-31 12:03:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:03:07,598 INFO L225 Difference]: With dead ends: 227 [2022-01-31 12:03:07,599 INFO L226 Difference]: Without dead ends: 227 [2022-01-31 12:03:07,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 72 SyntacticMatches, 15 SemanticMatches, 146 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 5152 ImplicationChecksByTransitivity, 85.0s TimeCoverageRelationStatistics Valid=1389, Invalid=15684, Unknown=25, NotChecked=4658, Total=21756 [2022-01-31 12:03:07,601 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 147 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2014 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:03:07,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 819 Invalid, 4661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2464 Invalid, 0 Unknown, 2014 Unchecked, 1.2s Time] [2022-01-31 12:03:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-31 12:03:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 149. [2022-01-31 12:03:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 123 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 12:03:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2022-01-31 12:03:07,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 58 [2022-01-31 12:03:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:03:07,610 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2022-01-31 12:03:07,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 78 states have internal predecessors, (118), 9 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 12:03:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2022-01-31 12:03:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 12:03:07,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:03:07,611 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:03:07,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-01-31 12:03:07,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 12:03:07,827 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:03:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:03:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash -961243463, now seen corresponding path program 10 times [2022-01-31 12:03:07,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:03:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535818095] [2022-01-31 12:03:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:07,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:03:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:03:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:03:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 12:03:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 12:03:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 12:03:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:08,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:03:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535818095] [2022-01-31 12:03:08,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535818095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:03:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645469558] [2022-01-31 12:03:08,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:03:08,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:03:08,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:03:08,685 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:03:08,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 12:03:08,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:03:08,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:03:08,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-31 12:03:08,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:03:08,811 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 12:03:08,869 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 12:03:08,956 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 12:03:09,038 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 27 treesize of output 15 [2022-01-31 12:03:09,128 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 27 treesize of output 15 [2022-01-31 12:03:09,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,289 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 22 [2022-01-31 12:03:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 12:03:09,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 12:03:09,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:09,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-01-31 12:03:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:16,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-31 12:03:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:16,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:03:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 12:03:18,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645469558] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:03:18,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:03:18,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 22] total 68 [2022-01-31 12:03:18,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454992663] [2022-01-31 12:03:18,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:03:18,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 12:03:18,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:03:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 12:03:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4165, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 12:03:18,548 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 68 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 12 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11)