/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s4if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:37:29,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:37:29,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:37:30,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:37:30,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:37:30,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:37:30,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:37:30,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:37:30,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:37:30,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:37:30,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:37:30,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:37:30,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:37:30,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:37:30,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:37:30,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:37:30,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:37:30,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:37:30,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:37:30,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:37:30,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:37:30,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:37:30,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:37:30,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:37:30,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:37:30,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:37:30,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:37:30,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:37:30,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:37:30,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:37:30,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:37:30,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:37:30,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:37:30,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:37:30,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:37:30,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:37:30,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:37:30,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:37:30,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:37:30,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:37:30,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:37:30,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 01:37:30,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:37:30,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:37:30,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:37:30,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:37:30,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:37:30,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:37:30,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:37:30,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:37:30,117 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:37:30,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:37:30,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:37:30,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:37:30,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:37:30,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:37:30,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:37:30,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:37:30,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 01:37:30,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:37:30,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:37:30,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:37:30,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:37:30,376 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:37:30,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s4if.c [2022-01-31 01:37:30,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a512c461/ac43bac46dbf45408ca8e6b84064f43b/FLAG6053bbc0d [2022-01-31 01:37:30,736 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:37:30,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4if.c [2022-01-31 01:37:30,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a512c461/ac43bac46dbf45408ca8e6b84064f43b/FLAG6053bbc0d [2022-01-31 01:37:30,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a512c461/ac43bac46dbf45408ca8e6b84064f43b [2022-01-31 01:37:30,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:37:30,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:37:30,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:37:30,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:37:30,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:37:30,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:30,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29acb9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30, skipping insertion in model container [2022-01-31 01:37:30,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:30,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:37:30,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:37:30,903 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/s4if.c[587,600] [2022-01-31 01:37:30,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:37:30,933 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:37:30,942 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/s4if.c[587,600] [2022-01-31 01:37:30,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:37:30,973 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:37:30,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30 WrapperNode [2022-01-31 01:37:30,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:37:30,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:37:30,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:37:30,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:37:30,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:30,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:30,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:30,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:31,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:31,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:31,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:31,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:37:31,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:37:31,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:37:31,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:37:31,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (1/1) ... [2022-01-31 01:37:31,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:37:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:31,044 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 01:37:31,064 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 01:37:31,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:37:31,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:37:31,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:37:31,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:37:31,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:37:31,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:37:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:37:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:37:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:37:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:37:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:37:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:37:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:37:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:37:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:37:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:37:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:37:31,141 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:37:31,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:37:31,314 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:37:31,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:37:31,318 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 01:37:31,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:37:31 BoogieIcfgContainer [2022-01-31 01:37:31,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:37:31,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:37:31,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:37:31,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:37:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:37:30" (1/3) ... [2022-01-31 01:37:31,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:37:31, skipping insertion in model container [2022-01-31 01:37:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:37:30" (2/3) ... [2022-01-31 01:37:31,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:37:31, skipping insertion in model container [2022-01-31 01:37:31,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:37:31" (3/3) ... [2022-01-31 01:37:31,332 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-01-31 01:37:31,335 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:37:31,335 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:37:31,374 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:37:31,381 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 01:37:31,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:37:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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 01:37:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:37:31,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:31,405 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] [2022-01-31 01:37:31,406 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash 863653859, now seen corresponding path program 1 times [2022-01-31 01:37:31,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:31,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899029449] [2022-01-31 01:37:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:31,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,590 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 01:37:31,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:31,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899029449] [2022-01-31 01:37:31,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899029449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:37:31,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:37:31,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:37:31,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479700785] [2022-01-31 01:37:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:37:31,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:37:31,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:37:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:37:31,616 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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.0) internal successors, (15), 2 states have internal predecessors, (15), 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 01:37:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:31,688 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-01-31 01:37:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:37:31,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 21 [2022-01-31 01:37:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:31,695 INFO L225 Difference]: With dead ends: 54 [2022-01-31 01:37:31,695 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 01:37:31,698 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 01:37:31,702 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:31,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:37:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 01:37:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 01:37:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 01:37:31,736 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 01:37:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:31,737 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 01:37:31,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 01:37:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 01:37:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:37:31,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:31,738 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] [2022-01-31 01:37:31,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:37:31,739 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1121819297, now seen corresponding path program 1 times [2022-01-31 01:37:31,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424954307] [2022-01-31 01:37:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:31,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:31,890 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 01:37:31,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424954307] [2022-01-31 01:37:31,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424954307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:37:31,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:37:31,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:37:31,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335488928] [2022-01-31 01:37:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:37:31,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:37:31,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:37:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:37:31,894 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 01:37:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:31,985 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-31 01:37:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:37:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-01-31 01:37:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:31,987 INFO L225 Difference]: With dead ends: 40 [2022-01-31 01:37:31,987 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 01:37:31,988 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 01:37:31,989 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:31,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:37:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 01:37:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-31 01:37:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 01:37:31,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2022-01-31 01:37:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:31,998 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 01:37:31,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 01:37:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 01:37:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:37:32,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:32,002 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 01:37:32,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:37:32,002 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash -667943349, now seen corresponding path program 1 times [2022-01-31 01:37:32,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:32,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470843492] [2022-01-31 01:37:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:32,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:32,360 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 01:37:32,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470843492] [2022-01-31 01:37:32,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470843492] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745022923] [2022-01-31 01:37:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:32,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:32,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:32,363 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 01:37:32,364 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 01:37:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 01:37:32,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:32,500 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 01:37:32,510 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 01:37:32,548 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 01:37:32,652 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:37:32,719 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 28 treesize of output 12 [2022-01-31 01:37:32,749 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 01:37:32,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:32,987 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-31 01:37:32,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:37:32,991 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 26 treesize of output 18 [2022-01-31 01:37:32,995 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 22 treesize of output 10 [2022-01-31 01:37:33,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 01:37:33,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745022923] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:33,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:33,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 28 [2022-01-31 01:37:33,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328937934] [2022-01-31 01:37:33,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:33,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 01:37:33,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:33,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 01:37:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2022-01-31 01:37:33,025 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 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 01:37:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:33,360 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-31 01:37:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:37:33,361 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 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 01:37:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:33,362 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:37:33,362 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 01:37:33,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 01:37:33,367 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:33,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 71 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 217 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-01-31 01:37:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 01:37:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-01-31 01:37:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-01-31 01:37:33,381 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2022-01-31 01:37:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:33,382 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-01-31 01:37:33,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 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 01:37:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-01-31 01:37:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:37:33,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:33,383 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 01:37:33,404 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 01:37:33,601 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 01:37:33,601 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1477289975, now seen corresponding path program 1 times [2022-01-31 01:37:33,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:33,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665361295] [2022-01-31 01:37:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:33,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:33,614 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:37:33,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186203133] [2022-01-31 01:37:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:33,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:33,636 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 01:37:33,672 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 01:37:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:33,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:37:33,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:33,722 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 01:37:33,747 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 01:37:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:33,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:33,786 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 14 treesize of output 12 [2022-01-31 01:37:33,788 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 22 treesize of output 20 [2022-01-31 01:37:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:33,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665361295] [2022-01-31 01:37:33,809 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:37:33,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186203133] [2022-01-31 01:37:33,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186203133] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:33,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:37:33,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 01:37:33,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427429145] [2022-01-31 01:37:33,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:33,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:37:33,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:37:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:37:33,810 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:33,852 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 01:37:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 01:37:33,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-31 01:37:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:33,867 INFO L225 Difference]: With dead ends: 50 [2022-01-31 01:37:33,867 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 01:37:33,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:37:33,868 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:33,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:37:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 01:37:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 01:37:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 01:37:33,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2022-01-31 01:37:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:33,873 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 01:37:33,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 01:37:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:37:33,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:33,874 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 01:37:33,915 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 01:37:34,091 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 01:37:34,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1722810441, now seen corresponding path program 2 times [2022-01-31 01:37:34,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343593539] [2022-01-31 01:37:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:34,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,184 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 01:37:34,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:34,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343593539] [2022-01-31 01:37:34,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343593539] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:34,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250707145] [2022-01-31 01:37:34,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:37:34,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:34,187 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 01:37:34,203 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 01:37:34,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:37:34,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:34,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:37:34,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:34,346 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 01:37:34,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:34,404 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 01:37:34,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250707145] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:34,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:34,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:37:34,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674865316] [2022-01-31 01:37:34,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:34,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:37:34,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:37:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:37:34,407 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 01:37:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:34,537 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-31 01:37:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:37:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 01:37:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:34,538 INFO L225 Difference]: With dead ends: 45 [2022-01-31 01:37:34,538 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 01:37:34,539 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 01:37:34,539 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:34,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:37:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 01:37:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-01-31 01:37:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 01:37:34,544 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-01-31 01:37:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:34,544 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 01:37:34,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 01:37:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 01:37:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 01:37:34,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:34,545 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] [2022-01-31 01:37:34,578 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 01:37:34,761 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 01:37:34,762 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1559730403, now seen corresponding path program 3 times [2022-01-31 01:37:34,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:34,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289643432] [2022-01-31 01:37:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:34,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:34,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:34,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289643432] [2022-01-31 01:37:34,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289643432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912533782] [2022-01-31 01:37:34,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:37:34,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:34,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:34,835 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 01:37:34,873 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 01:37:34,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:37:34,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:34,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:37:34,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:34,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:35,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912533782] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:35,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:35,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:37:35,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312058833] [2022-01-31 01:37:35,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:35,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:37:35,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:37:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:37:35,030 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 01:37:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:35,133 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 01:37:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:37:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 29 [2022-01-31 01:37:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:35,134 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:37:35,134 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:37:35,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 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 01:37:35,135 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:35,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 53 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:37:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:37:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 01:37:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 01:37:35,140 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 01:37:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:35,140 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 01:37:35,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 01:37:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 01:37:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:37:35,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:35,141 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:35,160 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 01:37:35,361 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 01:37:35,361 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1063218725, now seen corresponding path program 4 times [2022-01-31 01:37:35,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:35,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621665278] [2022-01-31 01:37:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:35,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:35,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621665278] [2022-01-31 01:37:35,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621665278] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932793957] [2022-01-31 01:37:35,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:37:35,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:35,748 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 01:37:35,759 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 01:37:35,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:37:35,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:35,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 01:37:35,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:35,853 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 01:37:35,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:35,889 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 01:37:35,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:35,943 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 01:37:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:36,101 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:37:36,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:36,194 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:36,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:37:36,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:36,330 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:36,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 18 [2022-01-31 01:37:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:36,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:43,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2)) (not (= .cse1 4)) (not (= .cse0 4)))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:37:43,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2)) (not (= .cse1 4)) (not (= .cse0 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0))))))) is different from false [2022-01-31 01:37:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 01:37:43,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932793957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:43,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:43,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2022-01-31 01:37:43,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650517350] [2022-01-31 01:37:43,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:43,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 01:37:43,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 01:37:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1128, Unknown=5, NotChecked=138, Total=1406 [2022-01-31 01:37:43,297 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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 01:37:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:43,640 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-01-31 01:37:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:37:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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 31 [2022-01-31 01:37:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:43,642 INFO L225 Difference]: With dead ends: 50 [2022-01-31 01:37:43,642 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:37:43,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=203, Invalid=1522, Unknown=5, NotChecked=162, Total=1892 [2022-01-31 01:37:43,644 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:43,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 326 Invalid, 0 Unknown, 222 Unchecked, 0.2s Time] [2022-01-31 01:37:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:37:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-01-31 01:37:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 01:37:43,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2022-01-31 01:37:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:43,650 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 01:37:43,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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 01:37:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 01:37:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:37:43,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:43,654 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, 1] [2022-01-31 01:37:43,674 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 01:37:43,870 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 01:37:43,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 253872099, now seen corresponding path program 1 times [2022-01-31 01:37:43,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:43,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756808545] [2022-01-31 01:37:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:43,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:43,880 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:37:43,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329284195] [2022-01-31 01:37:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:43,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:43,885 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 01:37:43,915 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 01:37:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:43,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 01:37:43,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:44,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:37:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:44,088 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 16 treesize of output 18 [2022-01-31 01:37:44,116 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 01:37:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:44,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:44,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 01:37:44,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:37:44,206 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:44,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:37:44,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:44,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:37:44,214 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 11 treesize of output 7 [2022-01-31 01:37:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-31 01:37:44,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756808545] [2022-01-31 01:37:44,281 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:37:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329284195] [2022-01-31 01:37:44,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329284195] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:44,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:37:44,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 01:37:44,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029190734] [2022-01-31 01:37:44,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:44,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:37:44,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:37:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-01-31 01:37:44,286 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:44,426 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-01-31 01:37:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:37:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 01:37:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:44,427 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:37:44,427 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:37:44,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2022-01-31 01:37:44,428 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:44,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 90 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-01-31 01:37:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:37:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 01:37:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 01:37:44,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2022-01-31 01:37:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:44,434 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 01:37:44,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 01:37:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 01:37:44,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:44,435 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:37:44,485 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 01:37:44,647 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 01:37:44,647 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash 656866023, now seen corresponding path program 5 times [2022-01-31 01:37:44,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:44,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201829629] [2022-01-31 01:37:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:44,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:44,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201829629] [2022-01-31 01:37:44,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201829629] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317690119] [2022-01-31 01:37:44,731 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:37:44,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:44,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:44,736 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 01:37:44,742 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 01:37:44,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:37:44,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:44,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:37:44,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:44,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:44,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317690119] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:44,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:44,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:37:44,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192985106] [2022-01-31 01:37:44,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:44,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:37:44,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:37:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:37:44,976 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 01:37:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:45,204 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-31 01:37:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:37:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 33 [2022-01-31 01:37:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:45,205 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:37:45,205 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:37:45,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 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 01:37:45,206 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:45,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:37:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:37:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-01-31 01:37:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 01:37:45,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 01:37:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:45,210 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 01:37:45,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 01:37:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 01:37:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:37:45,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:45,211 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-31 01:37:45,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 01:37:45,431 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 01:37:45,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 641786569, now seen corresponding path program 6 times [2022-01-31 01:37:45,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:45,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193920395] [2022-01-31 01:37:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:45,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:45,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:45,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193920395] [2022-01-31 01:37:45,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193920395] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:45,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340964065] [2022-01-31 01:37:45,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:37:45,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:45,544 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 01:37:45,589 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 01:37:45,627 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:37:45,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:45,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:37:45,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:45,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:45,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340964065] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:45,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:45,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:37:45,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031186966] [2022-01-31 01:37:45,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:45,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:37:45,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:45,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:37:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:37:45,830 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 01:37:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:45,958 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-31 01:37:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:37:45,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 34 [2022-01-31 01:37:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:45,959 INFO L225 Difference]: With dead ends: 57 [2022-01-31 01:37:45,959 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:37:45,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:37:45,960 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:45,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:37:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:37:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-01-31 01:37:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-01-31 01:37:45,965 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-01-31 01:37:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:45,965 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-01-31 01:37:45,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 01:37:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-01-31 01:37:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:37:45,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:45,966 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:45,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 01:37:46,175 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 01:37:46,176 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1793718585, now seen corresponding path program 7 times [2022-01-31 01:37:46,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:46,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319836715] [2022-01-31 01:37:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:46,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:46,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319836715] [2022-01-31 01:37:46,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319836715] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362026769] [2022-01-31 01:37:46,810 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:37:46,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:46,813 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 01:37:46,819 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 01:37:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:46,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 01:37:46,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:46,894 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 01:37:46,898 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 01:37:46,907 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 01:37:46,936 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 01:37:46,972 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 01:37:47,081 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:37:47,171 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:47,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:37:47,293 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:47,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:37:47,452 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:47,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-01-31 01:37:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:47,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:56,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (= (* ~N~0 4) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 4))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:37:57,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (= (* ~N~0 4) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 01:37:57,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse5 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* ~N~0 4) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 4))))))))) is different from false [2022-01-31 01:37:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 01:37:57,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362026769] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:57,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:57,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 46 [2022-01-31 01:37:57,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444059608] [2022-01-31 01:37:57,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:57,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-31 01:37:57,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-31 01:37:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1652, Unknown=7, NotChecked=252, Total=2070 [2022-01-31 01:37:57,497 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 46 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 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 01:37:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:57,836 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-01-31 01:37:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:37:57,837 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 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 36 [2022-01-31 01:37:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:57,837 INFO L225 Difference]: With dead ends: 56 [2022-01-31 01:37:57,837 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:37:57,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=216, Invalid=2045, Unknown=7, NotChecked=282, Total=2550 [2022-01-31 01:37:57,839 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:57,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 207 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 336 Invalid, 0 Unknown, 290 Unchecked, 0.2s Time] [2022-01-31 01:37:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:37:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-01-31 01:37:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-31 01:37:57,844 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-01-31 01:37:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:57,844 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-31 01:37:57,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 43 states have internal predecessors, (71), 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 01:37:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-31 01:37:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:37:57,845 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:57,845 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 01:37:57,862 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 01:37:58,055 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 01:37:58,055 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1691902085, now seen corresponding path program 2 times [2022-01-31 01:37:58,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811257573] [2022-01-31 01:37:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:58,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:58,067 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:37:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637651020] [2022-01-31 01:37:58,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:37:58,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:58,068 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 01:37:58,084 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 01:37:58,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:37:58,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:58,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:37:58,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:58,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:37:58,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:58,250 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 16 treesize of output 18 [2022-01-31 01:37:58,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:37:58,280 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 16 treesize of output 18 [2022-01-31 01:37:58,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:37:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:58,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:58,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 01:37:58,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 01:37:58,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 01:37:58,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:58,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:37:58,389 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:58,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:37:58,393 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 11 treesize of output 7 [2022-01-31 01:37:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-31 01:37:58,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:58,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811257573] [2022-01-31 01:37:58,469 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:37:58,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637651020] [2022-01-31 01:37:58,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637651020] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:58,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:37:58,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-31 01:37:58,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749903181] [2022-01-31 01:37:58,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:58,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:37:58,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:37:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-01-31 01:37:58,470 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:58,686 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-01-31 01:37:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:37:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 01:37:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:58,688 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:37:58,688 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:37:58,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2022-01-31 01:37:58,689 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:58,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 216 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-01-31 01:37:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:37:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-31 01:37:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-01-31 01:37:58,694 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2022-01-31 01:37:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:58,694 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-01-31 01:37:58,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:37:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-01-31 01:37:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:37:58,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:58,695 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:58,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-31 01:37:58,895 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 01:37:58,895 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1556995259, now seen corresponding path program 8 times [2022-01-31 01:37:58,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813337488] [2022-01-31 01:37:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:58,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:59,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:59,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813337488] [2022-01-31 01:37:59,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813337488] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:59,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454248894] [2022-01-31 01:37:59,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:37:59,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:59,015 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 01:37:59,016 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 01:37:59,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:37:59,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:59,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:37:59,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:59,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:59,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454248894] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:59,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:59,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:37:59,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661177967] [2022-01-31 01:37:59,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:59,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:37:59,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:37:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:37:59,251 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 01:37:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:59,467 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 01:37:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:37:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 38 [2022-01-31 01:37:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:59,468 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:37:59,468 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:37:59,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 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 01:37:59,469 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:59,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:37:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:37:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 01:37:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:37:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 01:37:59,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-01-31 01:37:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:59,474 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 01:37:59,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 01:37:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 01:37:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:37:59,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:59,474 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2022-01-31 01:37:59,493 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 01:37:59,683 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 01:37:59,683 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678105, now seen corresponding path program 9 times [2022-01-31 01:37:59,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149562102] [2022-01-31 01:37:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:59,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:59,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149562102] [2022-01-31 01:37:59,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149562102] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198098560] [2022-01-31 01:37:59,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:37:59,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:59,774 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 01:37:59,802 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 01:37:59,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:37:59,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:59,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:37:59,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:59,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:38:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:00,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198098560] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:38:00,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:38:00,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:38:00,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338645263] [2022-01-31 01:38:00,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:38:00,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:38:00,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:38:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:38:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:38:00,055 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 01:38:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:38:00,229 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 01:38:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:38:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 39 [2022-01-31 01:38:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:38:00,230 INFO L225 Difference]: With dead ends: 65 [2022-01-31 01:38:00,230 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 01:38:00,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:38:00,231 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:38:00,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 59 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:38:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 01:38:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 01:38:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:38:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-31 01:38:00,245 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2022-01-31 01:38:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:38:00,246 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-31 01:38:00,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 01:38:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-31 01:38:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:38:00,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:38:00,250 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:38:00,267 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 01:38:00,466 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 01:38:00,467 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:38:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:38:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1417373271, now seen corresponding path program 10 times [2022-01-31 01:38:00,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:38:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989887422] [2022-01-31 01:38:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:38:00,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:38:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:38:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:38:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:01,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:38:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989887422] [2022-01-31 01:38:01,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989887422] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:38:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528005878] [2022-01-31 01:38:01,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:38:01,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:38:01,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:38:01,068 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 01:38:01,069 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 01:38:01,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:38:01,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:38:01,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 01:38:01,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:38:01,149 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 01:38:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,184 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 01:38:01,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,236 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 01:38:01,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,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 14 treesize of output 16 [2022-01-31 01:38:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,326 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 01:38:01,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,465 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:38:01,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,575 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:01,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:38:01,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,717 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:01,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:38:01,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,864 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:01,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:38:01,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:01,986 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:01,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:38:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:02,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:38:19,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= .cse2 4)) (not (= .cse4 4)) (not (= .cse1 4)) (not (= .cse0 4)))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:38:19,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= .cse2 4)) (not (= .cse4 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse1 4)) (not (= .cse0 4)) (< (+ c_main_~i~0 2) ~N~0))))))))) is different from false [2022-01-31 01:38:20,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse2 4)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse4 4)) (not (= .cse1 4)) (not (= .cse0 4)))))))))) is different from false [2022-01-31 01:38:21,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (< (+ c_main_~i~0 4) ~N~0) (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= .cse2 4)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse4 4)) (not (= .cse1 4)) (not (= .cse0 4)))))))))) is different from false [2022-01-31 01:38:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 01:38:22,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528005878] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:38:22,071 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:38:22,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 57 [2022-01-31 01:38:22,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613883049] [2022-01-31 01:38:22,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:38:22,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 01:38:22,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:38:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 01:38:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2569, Unknown=12, NotChecked=420, Total=3192 [2022-01-31 01:38:22,078 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 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 01:38:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:38:22,688 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-01-31 01:38:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 01:38:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 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 41 [2022-01-31 01:38:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:38:22,689 INFO L225 Difference]: With dead ends: 64 [2022-01-31 01:38:22,689 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 01:38:22,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=246, Invalid=3064, Unknown=12, NotChecked=460, Total=3782 [2022-01-31 01:38:22,690 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:38:22,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 262 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 495 Unchecked, 0.2s Time] [2022-01-31 01:38:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 01:38:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-01-31 01:38:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:38:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-01-31 01:38:22,695 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 41 [2022-01-31 01:38:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:38:22,695 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-01-31 01:38:22,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 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 01:38:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-01-31 01:38:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:38:22,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:38:22,696 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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 01:38:22,725 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 01:38:22,896 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 01:38:22,897 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:38:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:38:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2068247399, now seen corresponding path program 3 times [2022-01-31 01:38:22,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:38:22,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023505794] [2022-01-31 01:38:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:38:22,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:38:22,905 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:38:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655940616] [2022-01-31 01:38:22,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:38:22,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:38:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:38:22,909 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 01:38:22,919 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 01:38:22,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:38:22,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:38:22,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:38:22,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:38:23,050 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 15 treesize of output 11 [2022-01-31 01:38:23,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:23,176 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 18 treesize of output 20 [2022-01-31 01:38:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:38:23,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:38:23,313 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 18 treesize of output 20 [2022-01-31 01:38:23,364 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-31 01:38:23,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-01-31 01:38:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:23,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:38:23,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_165 Int)) (or (< v_main_~i~0_165 3) (not (< v_main_~i~0_165 c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ (* 4 v_main_~i~0_165) c_main_~a~0.offset)) 4))) is different from false [2022-01-31 01:38:23,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_165 Int)) (or (< v_main_~i~0_165 3) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ (* 4 v_main_~i~0_165) c_main_~a~0.offset)) 4) (<= c_main_~i~0 v_main_~i~0_165))) is different from false [2022-01-31 01:38:23,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_main_~i~0_165 Int)) (or (<= (+ c_main_~i~0 1) v_main_~i~0_165) (< v_main_~i~0_165 3) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ (* 4 v_main_~i~0_165) c_main_~a~0.offset)) 4))) is different from false [2022-01-31 01:38:23,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:38:23,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-31 01:38:23,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:38:23,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-01-31 01:38:23,635 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 13 treesize of output 7 [2022-01-31 01:38:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-31 01:38:23,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:38:23,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023505794] [2022-01-31 01:38:23,792 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:38:23,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655940616] [2022-01-31 01:38:23,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655940616] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:38:23,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:38:23,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:38:23,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597802489] [2022-01-31 01:38:23,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:38:23,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:38:23,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:38:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:38:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=456, Unknown=4, NotChecked=138, Total=702 [2022-01-31 01:38:23,794 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:38:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:38:24,058 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-01-31 01:38:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 01:38:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-31 01:38:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:38:24,060 INFO L225 Difference]: With dead ends: 70 [2022-01-31 01:38:24,060 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 01:38:24,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=855, Unknown=4, NotChecked=192, Total=1260 [2022-01-31 01:38:24,062 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:38:24,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 247 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 138 Unchecked, 0.0s Time] [2022-01-31 01:38:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 01:38:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-31 01:38:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:38:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-01-31 01:38:24,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 41 [2022-01-31 01:38:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:38:24,072 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-01-31 01:38:24,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:38:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-01-31 01:38:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 01:38:24,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:38:24,072 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:38:24,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-31 01:38:24,289 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 01:38:24,289 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:38:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:38:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1382245397, now seen corresponding path program 11 times [2022-01-31 01:38:24,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:38:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76043213] [2022-01-31 01:38:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:38:24,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:38:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:38:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:38:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:24,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:38:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76043213] [2022-01-31 01:38:24,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76043213] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:38:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029290068] [2022-01-31 01:38:24,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:38:24,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:38:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:38:24,444 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 01:38:24,477 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 01:38:24,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:38:24,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:38:24,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:38:24,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:38:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:24,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:38:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:24,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029290068] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:38:24,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:38:24,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:38:24,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775367854] [2022-01-31 01:38:24,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:38:24,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:38:24,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:38:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:38:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:38:24,769 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 01:38:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:38:25,053 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-01-31 01:38:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:38:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 43 [2022-01-31 01:38:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:38:25,054 INFO L225 Difference]: With dead ends: 72 [2022-01-31 01:38:25,054 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 01:38:25,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:38:25,055 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:38:25,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 52 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:38:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 01:38:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-01-31 01:38:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:38:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-01-31 01:38:25,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 43 [2022-01-31 01:38:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:38:25,062 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-01-31 01:38:25,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 01:38:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-01-31 01:38:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:38:25,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:38:25,063 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:38:25,079 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 01:38:25,263 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 01:38:25,263 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:38:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:38:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 532928709, now seen corresponding path program 12 times [2022-01-31 01:38:25,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:38:25,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178624638] [2022-01-31 01:38:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:38:25,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:38:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:38:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:38:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:25,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:38:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178624638] [2022-01-31 01:38:25,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178624638] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:38:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75914015] [2022-01-31 01:38:25,401 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:38:25,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:38:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:38:25,403 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 01:38:25,403 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 01:38:25,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:38:25,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:38:25,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:38:25,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:38:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:25,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:38:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:25,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75914015] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:38:25,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:38:25,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:38:25,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830306122] [2022-01-31 01:38:25,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:38:25,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:38:25,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:38:25,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:38:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:38:25,718 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 01:38:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:38:25,926 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-01-31 01:38:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:38:25,926 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 44 [2022-01-31 01:38:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:38:25,927 INFO L225 Difference]: With dead ends: 73 [2022-01-31 01:38:25,927 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:38:25,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:38:25,927 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:38:25,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 75 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:38:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:38:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-01-31 01:38:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:38:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-01-31 01:38:25,934 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-01-31 01:38:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:38:25,934 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-01-31 01:38:25,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 01:38:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-01-31 01:38:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:38:25,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:38:25,935 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:38:25,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 01:38:26,143 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 01:38:26,144 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:38:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:38:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -944597181, now seen corresponding path program 13 times [2022-01-31 01:38:26,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:38:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184181809] [2022-01-31 01:38:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:38:26,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:38:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:38:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:26,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:38:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:26,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:38:26,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184181809] [2022-01-31 01:38:26,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184181809] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:38:26,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309641673] [2022-01-31 01:38:26,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:38:26,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:38:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:38:26,820 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 01:38:26,827 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 01:38:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:38:26,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 01:38:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:38:26,912 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 01:38:26,916 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 01:38:26,922 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 01:38:26,937 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 01:38:26,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, 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 01:38:26,979 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 01:38:27,010 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 01:38:27,177 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:38:27,299 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:27,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-01-31 01:38:27,471 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:38:27,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:38:27,632 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:38:27,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-01-31 01:38:27,780 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:38:27,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-01-31 01:38:28,013 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:38:28,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 28 [2022-01-31 01:38:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:38:28,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:25,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_231 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_231))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_226))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse4 .cse0 .cse3 .cse2 .cse1 .cse5)) (not (= 4 .cse5))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:39:27,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_231 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_231))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_226))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse4 .cse0 .cse3 .cse2 .cse1 .cse5)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 4 .cse5)) (< (+ c_main_~i~0 2) ~N~0)))))))))) is different from false [2022-01-31 01:39:30,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_231 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_231))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_226))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (or (not (= .cse0 4)) (< (+ c_main_~i~0 3) ~N~0) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* ~N~0 4) (+ .cse4 .cse0 .cse3 .cse2 .cse1 .cse5)) (not (= 4 .cse5))))))))))) is different from false [2022-01-31 01:39:33,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_231 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_231))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_226))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (or (not (= .cse0 4)) (< (+ c_main_~i~0 4) ~N~0) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (not (< (+ c_main_~i~0 3) ~N~0)) (= (* ~N~0 4) (+ .cse4 .cse0 .cse3 .cse2 .cse1 .cse5)) (not (= 4 .cse5))))))))))) is different from false [2022-01-31 01:39:37,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_231 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_231))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_226))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (or (not (= .cse0 4)) (< (+ c_main_~i~0 5) ~N~0) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse4 .cse0 .cse3 .cse2 .cse1 .cse5)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= 4 .cse5))))))))))) is different from false [2022-01-31 01:39:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-01-31 01:39:39,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309641673] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:39,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:39,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 62 [2022-01-31 01:39:39,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54236547] [2022-01-31 01:39:39,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:39,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-31 01:39:39,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-31 01:39:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2970, Unknown=32, NotChecked=570, Total=3782 [2022-01-31 01:39:39,433 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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 01:39:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:40,313 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-01-31 01:39:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:39:40,314 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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 46 [2022-01-31 01:39:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:40,314 INFO L225 Difference]: With dead ends: 73 [2022-01-31 01:39:40,314 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 01:39:40,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 59 SyntacticMatches, 13 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=272, Invalid=3622, Unknown=32, NotChecked=630, Total=4556 [2022-01-31 01:39:40,316 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:40,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 251 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 569 Invalid, 0 Unknown, 551 Unchecked, 0.4s Time] [2022-01-31 01:39:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 01:39:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-01-31 01:39:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-31 01:39:40,332 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 46 [2022-01-31 01:39:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:40,333 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-31 01:39:40,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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 01:39:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-31 01:39:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:39:40,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:40,333 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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 01:39:40,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-01-31 01:39:40,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:40,548 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1753943807, now seen corresponding path program 4 times [2022-01-31 01:39:40,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:40,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244293534] [2022-01-31 01:39:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:40,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:40,557 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:39:40,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683504330] [2022-01-31 01:39:40,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:39:40,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:40,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:40,558 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:39:40,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 01:39:40,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:39:40,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:40,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 01:39:40,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:40,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:39:40,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:40,763 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 16 treesize of output 18 [2022-01-31 01:39:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:40,801 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 16 treesize of output 18 [2022-01-31 01:39:40,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:40,837 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 16 treesize of output 18 [2022-01-31 01:39:40,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:40,871 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 16 treesize of output 18 [2022-01-31 01:39:40,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:39:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:40,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:40,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:39:40,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:39:40,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 01:39:41,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 4)) is different from false [2022-01-31 01:39:41,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_779) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 4)) is different from false [2022-01-31 01:39:41,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:39:41,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:39:41,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:39:41,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:39:41,025 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 11 treesize of output 7 [2022-01-31 01:39:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-01-31 01:39:41,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:41,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244293534] [2022-01-31 01:39:41,160 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:39:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683504330] [2022-01-31 01:39:41,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683504330] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:41,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:39:41,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:39:41,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689632536] [2022-01-31 01:39:41,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:41,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:39:41,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:39:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=405, Unknown=5, NotChecked=220, Total=702 [2022-01-31 01:39:41,161 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:41,569 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-01-31 01:39:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:39:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:39:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:41,570 INFO L225 Difference]: With dead ends: 77 [2022-01-31 01:39:41,570 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 01:39:41,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=713, Unknown=5, NotChecked=290, Total=1122 [2022-01-31 01:39:41,571 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:41,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 320 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 460 Invalid, 0 Unknown, 160 Unchecked, 0.2s Time] [2022-01-31 01:39:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 01:39:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-01-31 01:39:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-01-31 01:39:41,581 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 46 [2022-01-31 01:39:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:41,582 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-01-31 01:39:41,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-01-31 01:39:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:39:41,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:41,582 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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 01:39:41,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 01:39:41,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:41,798 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash -243532603, now seen corresponding path program 5 times [2022-01-31 01:39:41,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:41,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190260130] [2022-01-31 01:39:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:41,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:41,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:39:41,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521789408] [2022-01-31 01:39:41,808 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:39:41,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:41,809 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:39:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 01:39:41,917 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:39:41,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 01:39:41,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:41,943 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 01:39:41,990 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 15 treesize of output 11 [2022-01-31 01:39:42,030 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:39:42,030 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:39:42,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:39:42,108 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 16 treesize of output 18 [2022-01-31 01:39:42,140 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 16 treesize of output 18 [2022-01-31 01:39:42,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:39:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:39:42,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:42,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 01:39:42,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 01:39:42,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 01:39:42,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 01:39:42,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 01:39:42,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_271 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_271)) (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_271)) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))))) is different from false [2022-01-31 01:39:42,302 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 01:39:42,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 01:39:42,308 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:39:42,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:39:42,310 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 11 treesize of output 7 [2022-01-31 01:39:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-01-31 01:39:42,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190260130] [2022-01-31 01:39:42,366 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:39:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521789408] [2022-01-31 01:39:42,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521789408] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:42,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:39:42,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-01-31 01:39:42,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010987487] [2022-01-31 01:39:42,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:42,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 01:39:42,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 01:39:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=232, Unknown=6, NotChecked=210, Total=506 [2022-01-31 01:39:42,367 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:44,431 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ c_main_~i~0 (- 2)) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_271 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_271)) (forall ((v_ArrVal_838 Int) (v_ArrVal_841 (Array Int Int))) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_271)) v_ArrVal_838)) |c_main_~#sum~0.base| v_ArrVal_841) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4)) is different from false [2022-01-31 01:39:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:44,620 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-01-31 01:39:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:39:44,620 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:39:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:44,621 INFO L225 Difference]: With dead ends: 79 [2022-01-31 01:39:44,621 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 01:39:44,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=398, Unknown=7, NotChecked=322, Total=812 [2022-01-31 01:39:44,622 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:44,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 268 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-01-31 01:39:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 01:39:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-31 01:39:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-01-31 01:39:44,628 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 46 [2022-01-31 01:39:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:44,628 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-01-31 01:39:44,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:39:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-01-31 01:39:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 01:39:44,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:44,629 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:44,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 01:39:44,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:44,832 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 787197505, now seen corresponding path program 14 times [2022-01-31 01:39:44,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:44,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454319406] [2022-01-31 01:39:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:44,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:44,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:44,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454319406] [2022-01-31 01:39:44,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454319406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:44,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056252158] [2022-01-31 01:39:44,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:39:44,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:44,978 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:39:44,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 01:39:45,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:39:45,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:45,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:39:45,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:45,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:45,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056252158] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:45,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:45,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:39:45,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088050996] [2022-01-31 01:39:45,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:45,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:39:45,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:39:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:39:45,382 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 01:39:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:45,793 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-01-31 01:39:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:39:45,793 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 48 [2022-01-31 01:39:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:45,794 INFO L225 Difference]: With dead ends: 77 [2022-01-31 01:39:45,794 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 01:39:45,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 01:39:45,795 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:45,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 85 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:39:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 01:39:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-01-31 01:39:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-01-31 01:39:45,800 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 48 [2022-01-31 01:39:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:45,801 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-01-31 01:39:45,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 01:39:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-01-31 01:39:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:39:45,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:45,801 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:45,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:39:46,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 01:39:46,018 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1807662315, now seen corresponding path program 15 times [2022-01-31 01:39:46,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:46,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566001856] [2022-01-31 01:39:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:46,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:46,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:46,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566001856] [2022-01-31 01:39:46,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566001856] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:46,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312237084] [2022-01-31 01:39:46,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:39:46,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:46,205 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:39:46,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 01:39:46,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 01:39:46,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:46,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:39:46,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:46,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:39:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:46,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312237084] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:39:46,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:39:46,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:39:46,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263407525] [2022-01-31 01:39:46,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:39:46,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:39:46,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:39:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:39:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:39:46,537 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 01:39:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:39:46,809 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-01-31 01:39:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:39:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 49 [2022-01-31 01:39:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:39:46,810 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:39:46,810 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:39:46,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2022-01-31 01:39:46,811 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:39:46,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 75 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:39:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:39:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 01:39:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:39:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-01-31 01:39:46,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-01-31 01:39:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:39:46,817 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-01-31 01:39:46,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 01:39:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-01-31 01:39:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:39:46,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:39:46,817 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:39:46,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 01:39:47,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-31 01:39:47,034 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:39:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:39:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1738973907, now seen corresponding path program 16 times [2022-01-31 01:39:47,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:39:47,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103794018] [2022-01-31 01:39:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:39:47,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:39:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:39:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:39:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:39:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:48,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:39:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103794018] [2022-01-31 01:39:48,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103794018] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:39:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615152603] [2022-01-31 01:39:48,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:39:48,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:39:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:39:48,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:39:48,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 01:39:48,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:39:48,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:39:48,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 01:39:48,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:39:48,132 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 01:39:48,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,173 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 01:39:48,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,221 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 01:39:48,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,264 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 01:39:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,306 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 01:39:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,370 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 01:39:48,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,414 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 01:39:48,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,631 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:39:48,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,785 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:48,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:39:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:48,967 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:48,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:39:49,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:49,153 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:49,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:39:49,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:49,396 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:49,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:39:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:49,701 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:49,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:39:49,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:39:49,883 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:39:49,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-01-31 01:39:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:39:50,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:52,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (= .cse4 4)) (not (= 4 .cse6)))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:41:58,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (= .cse4 4)) (not (= 4 .cse6)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0))))))))))) is different from false [2022-01-31 01:42:14,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse4 4)) (not (= 4 .cse6)))))))))))) is different from false [2022-01-31 01:42:32,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= .cse0 4)) (not (= 4 .cse1)) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse4 4)) (not (= 4 .cse6)))))))))))) is different from false [2022-01-31 01:42:56,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (< (+ c_main_~i~0 5) ~N~0) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (= .cse4 4)) (not (= 4 .cse6)) (not (< (+ c_main_~i~0 4) ~N~0)))))))))))) is different from false [2022-01-31 01:43:24,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_main_~i~0_343 Int) (v_main_~i~0_332 Int) (v_main_~i~0_340 Int) (v_ArrVal_1027 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_338 Int) (v_main_~i~0_336 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1027))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_1027 (+ (* 4 v_main_~i~0_343) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_340))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_338))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_336))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse3 .cse5 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (or (not (= .cse0 4)) (not (= 4 .cse1)) (< (+ c_main_~i~0 6) ~N~0) (not (= .cse2 4)) (not (= .cse3 4)) (= (* ~N~0 4) (+ .cse0 .cse4 .cse2 .cse3 .cse5 .cse1 .cse6)) (not (= .cse4 4)) (not (= 4 .cse6)) (not (< (+ c_main_~i~0 5) ~N~0)))))))))))) is different from false [2022-01-31 01:43:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-01-31 01:43:39,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615152603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:43:39,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:43:39,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 26] total 77 [2022-01-31 01:43:39,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269897188] [2022-01-31 01:43:39,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:43:39,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-31 01:43:39,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:43:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-31 01:43:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=4683, Unknown=51, NotChecked=858, Total=5852 [2022-01-31 01:43:39,243 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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 01:43:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:43:46,092 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-01-31 01:43:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 01:43:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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 51 [2022-01-31 01:43:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:43:46,093 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:43:46,093 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 01:43:46,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 103.8s TimeCoverageRelationStatistics Valid=315, Invalid=5358, Unknown=51, NotChecked=918, Total=6642 [2022-01-31 01:43:46,095 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 953 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:43:46,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 389 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 953 Unchecked, 0.4s Time] [2022-01-31 01:43:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 01:43:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-31 01:43:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:43:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-01-31 01:43:46,103 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 51 [2022-01-31 01:43:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:43:46,103 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-01-31 01:43:46,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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 01:43:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-01-31 01:43:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:43:46,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:43:46,104 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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 01:43:46,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-31 01:43:46,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:46,318 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:43:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:43:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1746646763, now seen corresponding path program 6 times [2022-01-31 01:43:46,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:43:46,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218096611] [2022-01-31 01:43:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:43:46,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:43:46,328 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:43:46,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230106102] [2022-01-31 01:43:46,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:43:46,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:43:46,340 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:43:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-31 01:43:46,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 01:43:46,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:43:46,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 01:43:46,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:43:46,552 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 15 treesize of output 11 [2022-01-31 01:43:46,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:43:46,678 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 18 treesize of output 20 [2022-01-31 01:43:46,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:43:46,720 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 18 treesize of output 20 [2022-01-31 01:43:46,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:43:46,794 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 18 treesize of output 20 [2022-01-31 01:43:46,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:43:46,838 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 18 treesize of output 20 [2022-01-31 01:43:46,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:43:46,881 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 18 treesize of output 20 [2022-01-31 01:43:46,924 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:43:46,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 01:43:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 01:43:46,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:43:47,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (forall ((v_ArrVal_1108 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1108) c_main_~a~0.base) (+ c_main_~a~0.offset 12 (* main_~i~0 4))) 4)) (< (+ main_~i~0 4) c_~N~0) (not (< (+ main_~i~0 3) c_~N~0)))) is different from false [2022-01-31 01:43:47,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1108 (Array Int Int)) (main_~i~0 Int)) (or (< (+ main_~i~0 4) c_~N~0) (not (< (+ main_~i~0 3) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1108) c_main_~a~0.base) (+ c_main_~a~0.offset 12 (* main_~i~0 4))) 4))) is different from false [2022-01-31 01:43:47,537 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:43:47,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-01-31 01:43:47,549 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-01-31 01:43:47,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2022-01-31 01:43:47,555 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 3 [2022-01-31 01:43:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 32 not checked. [2022-01-31 01:43:47,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:43:47,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218096611] [2022-01-31 01:43:47,627 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:43:47,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230106102] [2022-01-31 01:43:47,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230106102] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:43:47,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:43:47,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 20 [2022-01-31 01:43:47,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360710838] [2022-01-31 01:43:47,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:43:47,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 01:43:47,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:43:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 01:43:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=8, NotChecked=66, Total=380 [2022-01-31 01:43:47,629 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:43:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:43:48,605 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-01-31 01:43:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:43:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 01:43:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:43:48,606 INFO L225 Difference]: With dead ends: 84 [2022-01-31 01:43:48,606 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 01:43:48,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=8, NotChecked=70, Total=420 [2022-01-31 01:43:48,607 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:43:48,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 186 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 85 Unchecked, 0.0s Time] [2022-01-31 01:43:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 01:43:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-01-31 01:43:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:43:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-01-31 01:43:48,625 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 51 [2022-01-31 01:43:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:43:48,626 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-01-31 01:43:48,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:43:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-01-31 01:43:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 01:43:48,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:43:48,626 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:43:48,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-01-31 01:43:48,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:48,839 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:43:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:43:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 147649775, now seen corresponding path program 17 times [2022-01-31 01:43:48,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:43:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784596226] [2022-01-31 01:43:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:43:48,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:43:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:43:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:43:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:49,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:43:49,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784596226] [2022-01-31 01:43:49,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784596226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:43:49,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183700393] [2022-01-31 01:43:49,069 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:43:49,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:43:49,071 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:43:49,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-31 01:43:49,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-31 01:43:49,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:43:49,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:43:49,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:43:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:49,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:43:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:49,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183700393] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:43:49,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:43:49,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:43:49,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433605120] [2022-01-31 01:43:49,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:43:49,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:43:49,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:43:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:43:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:43:49,677 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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 01:43:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:43:50,523 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-01-31 01:43:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:43:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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 53 [2022-01-31 01:43:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:43:50,524 INFO L225 Difference]: With dead ends: 97 [2022-01-31 01:43:50,524 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 01:43:50,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 01:43:50,525 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 01:43:50,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 111 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 01:43:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 01:43:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2022-01-31 01:43:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:43:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-01-31 01:43:50,533 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2022-01-31 01:43:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:43:50,533 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-01-31 01:43:50,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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 01:43:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-01-31 01:43:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 01:43:50,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:43:50,534 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:43:50,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-01-31 01:43:50,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-31 01:43:50,735 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:43:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:43:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1800419009, now seen corresponding path program 18 times [2022-01-31 01:43:50,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:43:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603529522] [2022-01-31 01:43:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:43:50,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:43:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:43:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:43:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:50,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:43:50,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603529522] [2022-01-31 01:43:50,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603529522] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:43:50,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920968446] [2022-01-31 01:43:50,955 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:43:50,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:43:50,956 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:43:50,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-31 01:43:51,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-01-31 01:43:51,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:43:51,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:43:51,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:43:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:51,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:43:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:51,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920968446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:43:51,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:43:51,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:43:51,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289045039] [2022-01-31 01:43:51,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:43:51,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:43:51,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:43:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:43:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:43:51,677 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 01:43:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:43:52,092 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-01-31 01:43:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 01:43:52,092 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 54 [2022-01-31 01:43:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:43:52,093 INFO L225 Difference]: With dead ends: 106 [2022-01-31 01:43:52,093 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:43:52,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 01:43:52,094 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:43:52,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 58 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:43:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:43:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-01-31 01:43:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:43:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-01-31 01:43:52,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 54 [2022-01-31 01:43:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:43:52,101 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-01-31 01:43:52,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 01:43:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-01-31 01:43:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 01:43:52,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:43:52,102 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:43:52,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-31 01:43:52,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-31 01:43:52,302 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:43:52,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:43:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2030473281, now seen corresponding path program 19 times [2022-01-31 01:43:52,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:43:52,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346339590] [2022-01-31 01:43:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:43:52,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:43:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:43:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:43:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:53,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:43:53,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346339590] [2022-01-31 01:43:53,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346339590] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:43:53,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309504540] [2022-01-31 01:43:53,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:43:53,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:43:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:43:53,892 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:43:53,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-31 01:43:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:43:53,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-31 01:43:53,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:43:54,008 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 01:43:54,012 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 01:43:54,022 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 01:43:54,045 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 01:43:54,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 01:43:54,101 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 01:43:54,134 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 01:43:54,167 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 01:43:54,202 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 01:43:54,422 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:43:54,574 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:54,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:43:54,756 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:54,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:43:54,987 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:54,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:43:55,234 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:43:55,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 65 [2022-01-31 01:43:56,553 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:56,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:43:57,409 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:57,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:43:57,613 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:43:57,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:43:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:43:57,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:49:25,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_444 Int) (v_main_~i~0_453 Int) (v_main_~i~0_442 Int) (v_main_~i~0_450 Int) (v_main_~i~0_440 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse9 |c_main_~#sum~0.offset|)) (.cse5 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_453))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_450))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 4 .cse7)) (not (= 4 .cse6)) (not (= .cse3 4)) (not (= .cse5 4))))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:49:55,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_444 Int) (v_main_~i~0_453 Int) (v_main_~i~0_442 Int) (v_main_~i~0_450 Int) (v_main_~i~0_440 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse9 |c_main_~#sum~0.offset|)) (.cse5 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_453))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_450))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 4 .cse7)) (not (= 4 .cse6)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse3 4)) (not (= .cse5 4)) (< (+ c_main_~i~0 2) ~N~0)))))))))))) is different from false [2022-01-31 01:51:03,879 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_444 Int) (v_main_~i~0_453 Int) (v_main_~i~0_442 Int) (v_main_~i~0_450 Int) (v_main_~i~0_440 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_1320 (Array Int Int)) (v_main_~i~0_448 Int) (v_main_~i~0_446 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1320))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse9 |c_main_~#sum~0.offset|)) (.cse5 (select v_ArrVal_1320 (+ main_~a~0.offset (* 4 v_main_~i~0_453))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_450))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_448))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_446))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_444))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_442))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_440))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse2 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= 4 .cse7)) (not (= 4 .cse6)) (not (= .cse3 4)) (not (= .cse5 4))))))))))))) is different from false