/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/s52if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:46:56,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:46:56,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:46:56,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:46:56,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:46:56,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:46:56,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:46:56,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:46:56,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:46:56,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:46:56,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:46:56,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:46:56,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:46:56,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:46:56,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:46:56,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:46:56,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:46:56,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:46:56,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:46:56,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:46:56,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:46:56,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:46:56,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:46:56,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:46:56,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:46:56,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:46:56,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:46:56,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:46:56,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:46:56,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:46:56,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:46:56,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:46:56,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:46:56,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:46:56,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:46:56,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:46:56,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:46:56,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:46:56,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:46:56,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:46:56,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:46:56,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:46:56,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:46:56,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:46:56,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:46:56,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:46:56,862 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:46:56,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:46:56,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:46:56,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:46:56,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:46:56,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:46:56,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:46:56,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:46:56,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:46:56,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:46:56,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:46:56,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:46:56,864 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 11:46:57,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:46:57,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:46:57,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:46:57,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:46:57,142 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:46:57,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s52if.c [2022-01-31 11:46:57,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282758aba/14d4106cda714055a51bb1fd0f8b9d72/FLAG485ac5ba4 [2022-01-31 11:46:57,566 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:46:57,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s52if.c [2022-01-31 11:46:57,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282758aba/14d4106cda714055a51bb1fd0f8b9d72/FLAG485ac5ba4 [2022-01-31 11:46:57,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282758aba/14d4106cda714055a51bb1fd0f8b9d72 [2022-01-31 11:46:57,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:46:57,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:46:57,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:46:57,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:46:57,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:46:57,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d6770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57, skipping insertion in model container [2022-01-31 11:46:57,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:46:57,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:46:57,746 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/s52if.c[588,601] [2022-01-31 11:46:57,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:46:57,773 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:46:57,783 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/s52if.c[588,601] [2022-01-31 11:46:57,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:46:57,801 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:46:57,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57 WrapperNode [2022-01-31 11:46:57,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:46:57,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:46:57,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:46:57,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:46:57,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:46:57,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:46:57,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:46:57,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:46:57,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (1/1) ... [2022-01-31 11:46:57,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:46:57,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:57,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 11:46:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 11:46:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:46:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:46:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:46:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:46:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:46:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:46:57,891 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:46:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:46:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:46:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:46:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:46:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:46:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:46:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:46:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:46:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:46:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:46:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:46:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:46:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:46:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:46:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:46:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:46:57,971 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:46:57,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:46:58,100 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:46:58,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:46:58,119 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:46:58,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:46:58 BoogieIcfgContainer [2022-01-31 11:46:58,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:46:58,122 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:46:58,122 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:46:58,123 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:46:58,125 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:46:58" (1/1) ... [2022-01-31 11:46:58,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:46:58 BasicIcfg [2022-01-31 11:46:58,145 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:46:58,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:46:58,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:46:58,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:46:58,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:46:57" (1/4) ... [2022-01-31 11:46:58,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f81228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:46:58, skipping insertion in model container [2022-01-31 11:46:58,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:46:57" (2/4) ... [2022-01-31 11:46:58,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f81228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:46:58, skipping insertion in model container [2022-01-31 11:46:58,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:46:58" (3/4) ... [2022-01-31 11:46:58,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f81228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:46:58, skipping insertion in model container [2022-01-31 11:46:58,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:46:58" (4/4) ... [2022-01-31 11:46:58,154 INFO L111 eAbstractionObserver]: Analyzing ICFG s52if.cJordan [2022-01-31 11:46:58,158 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:46:58,158 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:46:58,195 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:46:58,209 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 11:46:58,210 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:46:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:46:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:46:58,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:58,232 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] [2022-01-31 11:46:58,232 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 891722992, now seen corresponding path program 1 times [2022-01-31 11:46:58,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:58,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032363036] [2022-01-31 11:46:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:58,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:46:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:46:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:46:58,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:58,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032363036] [2022-01-31 11:46:58,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032363036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:46:58,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:46:58,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:46:58,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367358447] [2022-01-31 11:46:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:46:58,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:46:58,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:46:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:46:58,549 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:46:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:58,623 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-01-31 11:46:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:46:58,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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 23 [2022-01-31 11:46:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:58,635 INFO L225 Difference]: With dead ends: 36 [2022-01-31 11:46:58,635 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 11:46:58,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:46:58,646 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:58,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:46:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 11:46:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 11:46:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 11:46:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 11:46:58,675 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-31 11:46:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:58,676 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 11:46:58,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:46:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 11:46:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:46:58,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:58,677 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] [2022-01-31 11:46:58,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:46:58,678 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:58,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1828318323, now seen corresponding path program 1 times [2022-01-31 11:46:58,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:58,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690481468] [2022-01-31 11:46:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:58,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:46:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:46:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:46:58,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:58,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690481468] [2022-01-31 11:46:58,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690481468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:46:58,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:46:58,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:46:58,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813384375] [2022-01-31 11:46:58,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:46:58,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:46:58,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:46:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:46:58,763 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:46:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:58,837 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-31 11:46:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:46:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2022-01-31 11:46:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:58,839 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:46:58,839 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 11:46:58,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:46:58,841 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:58,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:46:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 11:46:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-31 11:46:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 11:46:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 11:46:58,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 11:46:58,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:58,847 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 11:46:58,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:46:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 11:46:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:46:58,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:58,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:46:58,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:46:58,848 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -343654416, now seen corresponding path program 1 times [2022-01-31 11:46:58,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:58,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886575702] [2022-01-31 11:46:58,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:58,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:58,869 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:46:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847369748] [2022-01-31 11:46:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:58,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:58,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:46:58,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 11:46:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:46:58,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:46:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:46:59,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 11:46:59,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 11:46:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:46:59,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:59,310 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 39 treesize of output 33 [2022-01-31 11:46:59,318 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:46:59,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-01-31 11:46:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:46:59,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886575702] [2022-01-31 11:46:59,364 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:46:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847369748] [2022-01-31 11:46:59,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847369748] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:59,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:46:59,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-31 11:46:59,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322741870] [2022-01-31 11:46:59,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:59,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:46:59,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:46:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:46:59,369 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:46:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:59,532 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-01-31 11:46:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:46:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 11:46:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:59,535 INFO L225 Difference]: With dead ends: 46 [2022-01-31 11:46:59,535 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 11:46:59,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:46:59,538 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:59,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:46:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 11:46:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-01-31 11:46:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 11:46:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-31 11:46:59,550 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2022-01-31 11:46:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:59,551 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-31 11:46:59,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:46:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-31 11:46:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:46:59,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:59,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:46:59,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:46:59,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:59,783 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464751, now seen corresponding path program 1 times [2022-01-31 11:46:59,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023026789] [2022-01-31 11:46:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:59,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:47:00,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023026789] [2022-01-31 11:47:00,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023026789] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:00,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143248449] [2022-01-31 11:47:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:00,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:00,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:00,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:00,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 11:47:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:00,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:47:00,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:00,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:47:00,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:47:00,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:00,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:00,549 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 11:47:00,679 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 34 treesize of output 10 [2022-01-31 11:47:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:00,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:00,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_74 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int)) (let ((.cse0 (select v_ArrVal_74 (+ main_~a~0.offset (* main_~i~0 4))))) (or (not (= .cse0 6)) (= (* c_~N~0 6) (+ .cse0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_74) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) is different from false [2022-01-31 11:47:01,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:01,084 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 11:47:01,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:01,089 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 11:47:01,092 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 11:47:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 11:47:01,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143248449] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:01,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:01,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 26 [2022-01-31 11:47:01,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345011016] [2022-01-31 11:47:01,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:01,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 11:47:01,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 11:47:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=518, Unknown=1, NotChecked=46, Total=650 [2022-01-31 11:47:01,123 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 26 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:47:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:01,557 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-01-31 11:47:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:47:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 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 31 [2022-01-31 11:47:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:01,559 INFO L225 Difference]: With dead ends: 57 [2022-01-31 11:47:01,559 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 11:47:01,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=1006, Unknown=1, NotChecked=66, Total=1260 [2022-01-31 11:47:01,561 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:01,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 122 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 258 Invalid, 0 Unknown, 161 Unchecked, 0.2s Time] [2022-01-31 11:47:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 11:47:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-01-31 11:47:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 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 11:47:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-01-31 11:47:01,566 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2022-01-31 11:47:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:01,566 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-01-31 11:47:01,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:47:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-01-31 11:47:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:47:01,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:01,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:01,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:01,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 11:47:01,788 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -637057423, now seen corresponding path program 1 times [2022-01-31 11:47:01,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439461691] [2022-01-31 11:47:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:01,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:01,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:01,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716009520] [2022-01-31 11:47:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:01,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:01,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:01,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 11:47:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:01,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:47:01,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:01,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:47:01,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:47:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:01,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:02,012 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 11:47:02,014 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 11:47:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:02,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439461691] [2022-01-31 11:47:02,051 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716009520] [2022-01-31 11:47:02,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716009520] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:02,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:02,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 11:47:02,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272355062] [2022-01-31 11:47:02,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:02,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:47:02,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:47:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:47:02,053 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:02,117 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-31 11:47:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:47:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 11:47:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:02,118 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:47:02,118 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:47:02,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:47:02,119 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:02,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:47:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:47:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-01-31 11:47:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 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 11:47:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-01-31 11:47:02,123 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 31 [2022-01-31 11:47:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:02,124 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-01-31 11:47:02,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-01-31 11:47:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:47:02,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:02,125 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, 1, 1, 1, 1, 1] [2022-01-31 11:47:02,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:02,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:02,342 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash -531940331, now seen corresponding path program 2 times [2022-01-31 11:47:02,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515646982] [2022-01-31 11:47:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:02,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:02,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515646982] [2022-01-31 11:47:02,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515646982] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457029171] [2022-01-31 11:47:02,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:47:02,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:02,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:02,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 11:47:02,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:47:02,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:02,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:47:02,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:02,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:02,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457029171] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:02,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:02,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:47:02,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599796056] [2022-01-31 11:47:02,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:02,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:47:02,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:47:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:47:02,667 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:02,892 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-01-31 11:47:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:47:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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 11:47:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:02,894 INFO L225 Difference]: With dead ends: 69 [2022-01-31 11:47:02,894 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 11:47:02,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:47:02,895 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:02,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 62 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 11:47:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-01-31 11:47:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 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 11:47:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 11:47:02,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 33 [2022-01-31 11:47:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:02,900 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 11:47:02,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 11:47:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:47:02,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:02,901 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, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:02,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:03,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:03,102 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1196805917, now seen corresponding path program 1 times [2022-01-31 11:47:03,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:03,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378941920] [2022-01-31 11:47:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:03,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:03,123 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:03,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591221545] [2022-01-31 11:47:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:03,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:03,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:03,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 11:47:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:03,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:47:03,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:03,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:03,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:03,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378941920] [2022-01-31 11:47:03,335 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:03,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591221545] [2022-01-31 11:47:03,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591221545] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:03,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:03,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 11:47:03,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550377146] [2022-01-31 11:47:03,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:03,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:47:03,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:47:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:47:03,336 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:03,467 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-01-31 11:47:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:47:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 11:47:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:03,468 INFO L225 Difference]: With dead ends: 62 [2022-01-31 11:47:03,468 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:47:03,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:47:03,469 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:03,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 81 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:47:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 11:47:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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 11:47:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-31 11:47:03,472 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2022-01-31 11:47:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:03,473 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-31 11:47:03,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-31 11:47:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:47:03,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:03,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:03,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:03,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:03,684 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1165711052, now seen corresponding path program 2 times [2022-01-31 11:47:03,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599548908] [2022-01-31 11:47:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:03,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:03,696 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:03,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365147201] [2022-01-31 11:47:03,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:47:03,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:03,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:03,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:47:03,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:47:03,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:03,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:47:03,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:03,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:47:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:03,947 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 11:47:03,990 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:03,990 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 11:47:04,056 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 11:47:04,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:04,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_main_~i~0_63 Int)) (or (< (+ v_main_~i~0_63 1) c_~N~0) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_205) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 4)))) (not (<= v_main_~i~0_63 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:47:04,297 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:04,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 11:47:04,305 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:04,306 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 44 [2022-01-31 11:47:04,311 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 11:47:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 11:47:04,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599548908] [2022-01-31 11:47:04,594 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:04,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365147201] [2022-01-31 11:47:04,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365147201] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:04,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:04,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-01-31 11:47:04,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728293318] [2022-01-31 11:47:04,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:04,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:47:04,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:47:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=561, Unknown=8, NotChecked=50, Total=756 [2022-01-31 11:47:04,597 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 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 11:47:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:04,992 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-01-31 11:47:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:47:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 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 39 [2022-01-31 11:47:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:04,994 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:47:04,994 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:47:04,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=921, Unknown=9, NotChecked=66, Total=1260 [2022-01-31 11:47:04,995 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:04,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 201 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 283 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-01-31 11:47:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:47:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-01-31 11:47:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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 11:47:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-31 11:47:05,000 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2022-01-31 11:47:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:05,000 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-31 11:47:05,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 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 11:47:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-31 11:47:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:47:05,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:05,001 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:05,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:05,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:05,214 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1386445909, now seen corresponding path program 3 times [2022-01-31 11:47:05,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:05,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650281002] [2022-01-31 11:47:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:05,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:47:05,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650281002] [2022-01-31 11:47:05,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650281002] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575657979] [2022-01-31 11:47:05,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:47:05,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:05,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:05,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:47:05,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:47:05,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:05,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:47:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:05,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:47:05,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:05,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:05,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:05,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:05,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:05,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:06,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:06,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:06,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:06,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 11:47:06,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:06,265 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:06,265 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 59 treesize of output 41 [2022-01-31 11:47:06,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:06,417 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:06,417 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 45 treesize of output 17 [2022-01-31 11:47:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:47:06,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:09,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= .cse0 6)) (and (<= (div (+ (- 1) .cse1 .cse0 .cse2) 6) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse1 .cse0 .cse2) 6))) (not (= .cse2 6)))))))) is different from false [2022-01-31 11:47:09,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (and (<= (div (+ (- 1) .cse0 .cse1 .cse2) 6) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 6))) (not (= .cse1 6)) (not (= .cse2 6)))))))) is different from false [2022-01-31 11:47:09,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= .cse0 6)) (and (<= (div (+ (- 1) .cse1 .cse0 .cse2) 6) 1) (<= 2 (div (+ .cse1 .cse0 .cse2) 6))) (not (= .cse2 6)))))))) is different from false [2022-01-31 11:47:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-01-31 11:47:10,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575657979] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:10,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:10,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 42 [2022-01-31 11:47:10,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234220571] [2022-01-31 11:47:10,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:10,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 11:47:10,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 11:47:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1325, Unknown=6, NotChecked=228, Total=1722 [2022-01-31 11:47:10,226 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:11,580 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2022-01-31 11:47:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 11:47:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 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 39 [2022-01-31 11:47:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:11,581 INFO L225 Difference]: With dead ends: 122 [2022-01-31 11:47:11,581 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 11:47:11,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=406, Invalid=2570, Unknown=6, NotChecked=324, Total=3306 [2022-01-31 11:47:11,583 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 96 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:11,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 197 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 711 Invalid, 0 Unknown, 519 Unchecked, 0.5s Time] [2022-01-31 11:47:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 11:47:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-01-31 11:47:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 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 11:47:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-01-31 11:47:11,590 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 39 [2022-01-31 11:47:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:11,591 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-01-31 11:47:11,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-01-31 11:47:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:47:11,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:11,592 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:11,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:11,807 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 821770708, now seen corresponding path program 1 times [2022-01-31 11:47:11,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:11,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474171393] [2022-01-31 11:47:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:11,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:11,818 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798889820] [2022-01-31 11:47:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:11,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:11,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:11,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 11:47:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:11,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 11:47:11,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:11,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:47:11,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:11,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:47:12,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 11:47:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:47:12,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:14,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 6)))) is different from false [2022-01-31 11:47:14,168 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 44 treesize of output 38 [2022-01-31 11:47:14,175 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:47:14,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 158 [2022-01-31 11:47:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-01-31 11:47:14,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:14,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474171393] [2022-01-31 11:47:14,241 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:14,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798889820] [2022-01-31 11:47:14,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798889820] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:14,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:14,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 11:47:14,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127316104] [2022-01-31 11:47:14,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:14,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:47:14,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:47:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2022-01-31 11:47:14,242 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:16,268 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 5) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 6))))) is different from false [2022-01-31 11:47:18,276 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 6)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 5)) 1)) is different from false [2022-01-31 11:47:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:18,359 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2022-01-31 11:47:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:47:18,359 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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 39 [2022-01-31 11:47:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:18,360 INFO L225 Difference]: With dead ends: 127 [2022-01-31 11:47:18,360 INFO L226 Difference]: Without dead ends: 127 [2022-01-31 11:47:18,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=83, Invalid=232, Unknown=3, NotChecked=102, Total=420 [2022-01-31 11:47:18,361 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:18,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 151 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2022-01-31 11:47:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-31 11:47:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2022-01-31 11:47:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 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 11:47:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2022-01-31 11:47:18,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 39 [2022-01-31 11:47:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:18,367 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2022-01-31 11:47:18,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2022-01-31 11:47:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:47:18,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:18,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:18,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:18,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 11:47:18,584 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1676245229, now seen corresponding path program 1 times [2022-01-31 11:47:18,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993907345] [2022-01-31 11:47:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:18,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:18,600 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:18,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991863178] [2022-01-31 11:47:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:18,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:18,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:18,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 11:47:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:18,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:47:18,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:18,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 11:47:18,740 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:47:18,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:47:18,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:47:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:47:18,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:18,877 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 16 treesize of output 14 [2022-01-31 11:47:18,881 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 28 treesize of output 24 [2022-01-31 11:47:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:47:18,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993907345] [2022-01-31 11:47:18,904 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:18,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991863178] [2022-01-31 11:47:18,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991863178] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:18,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:18,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-01-31 11:47:18,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069092388] [2022-01-31 11:47:18,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:18,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 11:47:18,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 11:47:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 11:47:18,906 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:19,019 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-01-31 11:47:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:47:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 39 [2022-01-31 11:47:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:19,021 INFO L225 Difference]: With dead ends: 102 [2022-01-31 11:47:19,021 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 11:47:19,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:47:19,021 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:19,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 11:47:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2022-01-31 11:47:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 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 11:47:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-01-31 11:47:19,026 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 39 [2022-01-31 11:47:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:19,026 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-01-31 11:47:19,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-01-31 11:47:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:47:19,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:19,027 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:19,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-31 11:47:19,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:19,239 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1211084633, now seen corresponding path program 3 times [2022-01-31 11:47:19,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943057871] [2022-01-31 11:47:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:19,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:19,258 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:19,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392013275] [2022-01-31 11:47:19,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:47:19,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:19,259 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:19,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 11:47:19,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:47:19,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:19,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:47:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:47:19,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:47:19,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943057871] [2022-01-31 11:47:19,538 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392013275] [2022-01-31 11:47:19,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392013275] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:19,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:19,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:47:19,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521954313] [2022-01-31 11:47:19,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:19,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:47:19,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:47:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:47:19,540 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:19,669 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-01-31 11:47:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:47:19,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:47:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:19,670 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:47:19,670 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:47:19,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:47:19,671 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:19,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 94 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:47:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-01-31 11:47:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 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 11:47:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-01-31 11:47:19,675 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 42 [2022-01-31 11:47:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:19,675 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-01-31 11:47:19,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-01-31 11:47:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:47:19,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:19,676 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-01-31 11:47:19,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:19,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 11:47:19,883 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -23692747, now seen corresponding path program 4 times [2022-01-31 11:47:19,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:19,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103692062] [2022-01-31 11:47:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:19,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:19,902 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089420343] [2022-01-31 11:47:19,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:47:19,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:19,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:19,904 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:19,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 11:47:19,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:47:19,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:19,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:47:19,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:20,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:20,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:20,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103692062] [2022-01-31 11:47:20,193 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:20,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089420343] [2022-01-31 11:47:20,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089420343] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:20,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:20,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:47:20,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833825557] [2022-01-31 11:47:20,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:20,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:47:20,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:47:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:47:20,194 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:20,335 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-01-31 11:47:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:47:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 11:47:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:20,336 INFO L225 Difference]: With dead ends: 60 [2022-01-31 11:47:20,336 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 11:47:20,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:47:20,337 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:20,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 100 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 11:47:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-01-31 11:47:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 50 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 11:47:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-01-31 11:47:20,340 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 44 [2022-01-31 11:47:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:20,340 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-01-31 11:47:20,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-01-31 11:47:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:47:20,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:20,341 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-01-31 11:47:20,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:20,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 11:47:20,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 845505913, now seen corresponding path program 5 times [2022-01-31 11:47:20,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:20,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516317972] [2022-01-31 11:47:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:20,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:20,568 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:20,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584945347] [2022-01-31 11:47:20,568 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:47:20,568 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:20,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:20,570 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:20,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 11:47:20,684 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:47:20,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:20,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:47:20,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:20,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:47:20,816 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 31 treesize of output 15 [2022-01-31 11:47:20,872 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 11:47:20,908 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 11:47:20,941 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 21 treesize of output 9 [2022-01-31 11:47:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:47:20,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:20,999 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 6)) is different from false [2022-01-31 11:47:21,008 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:47:21,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6)) is different from false [2022-01-31 11:47:21,058 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:21,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 11:47:21,064 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:21,064 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 11:47:21,067 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 11:47:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-01-31 11:47:21,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516317972] [2022-01-31 11:47:21,143 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584945347] [2022-01-31 11:47:21,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584945347] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:21,143 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:21,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-01-31 11:47:21,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589729937] [2022-01-31 11:47:21,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:21,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:47:21,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:47:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=195, Unknown=3, NotChecked=90, Total=342 [2022-01-31 11:47:21,145 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:21,407 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-01-31 11:47:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 11:47:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 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 47 [2022-01-31 11:47:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:21,408 INFO L225 Difference]: With dead ends: 78 [2022-01-31 11:47:21,408 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 11:47:21,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=245, Unknown=3, NotChecked=102, Total=420 [2022-01-31 11:47:21,408 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:21,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 209 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 348 Invalid, 0 Unknown, 174 Unchecked, 0.2s Time] [2022-01-31 11:47:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 11:47:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-01-31 11:47:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 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 11:47:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-01-31 11:47:21,411 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 47 [2022-01-31 11:47:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:21,412 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-01-31 11:47:21,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-01-31 11:47:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:47:21,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:21,413 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-01-31 11:47:21,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:21,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 11:47:21,623 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash -897304422, now seen corresponding path program 6 times [2022-01-31 11:47:21,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:21,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369582412] [2022-01-31 11:47:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:21,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:21,635 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789826103] [2022-01-31 11:47:21,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:47:21,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:21,637 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:21,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 11:47:21,743 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:47:21,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:21,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:47:21,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:21,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:47:21,896 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:47:21,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:47:21,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:21,962 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 11:47:21,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:47:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 11:47:22,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:22,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 6)) is different from false [2022-01-31 11:47:22,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:47:22,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 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_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) is different from false [2022-01-31 11:47:22,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_155 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_155)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 6 (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_155)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) is different from false [2022-01-31 11:47:22,175 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:47:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-01-31 11:47:22,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:22,183 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 40 treesize of output 40 [2022-01-31 11:47:22,186 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 11:47:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-01-31 11:47:22,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369582412] [2022-01-31 11:47:22,295 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789826103] [2022-01-31 11:47:22,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789826103] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:22,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:22,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-01-31 11:47:22,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021732028] [2022-01-31 11:47:22,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:22,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:47:22,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:47:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=275, Unknown=4, NotChecked=148, Total=506 [2022-01-31 11:47:22,297 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 11:47:24,360 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_155 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_155)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 6 (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_155)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) is different from false [2022-01-31 11:47:26,383 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_535 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6) (<= 2 c_main_~i~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_155 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_155)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 6 (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_155)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) is different from false [2022-01-31 11:47:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:26,589 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-01-31 11:47:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:47:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 47 [2022-01-31 11:47:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:26,590 INFO L225 Difference]: With dead ends: 104 [2022-01-31 11:47:26,590 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 11:47:26,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=106, Invalid=374, Unknown=6, NotChecked=270, Total=756 [2022-01-31 11:47:26,591 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:26,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 234 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 254 Invalid, 0 Unknown, 201 Unchecked, 0.2s Time] [2022-01-31 11:47:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 11:47:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2022-01-31 11:47:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 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 11:47:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-01-31 11:47:26,594 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 47 [2022-01-31 11:47:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:26,595 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-01-31 11:47:26,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 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 11:47:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-01-31 11:47:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:47:26,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:26,596 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:26,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:26,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 11:47:26,796 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 899646937, now seen corresponding path program 4 times [2022-01-31 11:47:26,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:26,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687622656] [2022-01-31 11:47:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:26,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:27,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687622656] [2022-01-31 11:47:27,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687622656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653844555] [2022-01-31 11:47:27,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:47:27,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:27,333 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 11:47:27,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:47:27,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:27,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:47:27,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:27,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:47:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,852 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 11:47:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:27,984 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:27,985 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 11:47:28,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:28,160 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:28,160 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 11:47:28,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:28,324 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:28,324 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 45 treesize of output 17 [2022-01-31 11:47:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:28,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:30,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_168 Int) (main_~i~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_170 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_593 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_170))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_168))))) (or (not (= .cse0 6)) (= (* c_~N~0 6) (+ .cse1 .cse0 .cse2 .cse3)) (not (= .cse1 6)) (not (= .cse2 6))))))))) is different from false [2022-01-31 11:47:30,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_main_~i~0_168 Int) (v_main_~i~0_177 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_170 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_177)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_170))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_168))))) (or (= (* 6 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= 6 .cse2)) (not (= .cse0 6)) (not (= .cse1 6))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:47:31,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_168 Int) (v_main_~i~0_177 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_170 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_177)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_170))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_168))))) (or (= (* 6 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= 6 .cse2)) (not (= .cse0 6)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse1 6)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 11:47:31,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_168 Int) (v_main_~i~0_177 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_170 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_177)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_170))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_168))))) (or (= (* 6 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= 6 .cse2)) (not (= .cse0 6)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse1 6))))))))) is different from false [2022-01-31 11:47:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-01-31 11:47:31,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653844555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:31,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:31,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 48 [2022-01-31 11:47:31,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697172690] [2022-01-31 11:47:31,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:31,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 11:47:31,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:31,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 11:47:31,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1746, Unknown=6, NotChecked=348, Total=2256 [2022-01-31 11:47:31,452 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:32,764 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2022-01-31 11:47:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 11:47:32,764 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 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 47 [2022-01-31 11:47:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:32,765 INFO L225 Difference]: With dead ends: 150 [2022-01-31 11:47:32,765 INFO L226 Difference]: Without dead ends: 146 [2022-01-31 11:47:32,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=340, Invalid=3210, Unknown=6, NotChecked=476, Total=4032 [2022-01-31 11:47:32,766 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:32,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 221 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 682 Invalid, 0 Unknown, 474 Unchecked, 0.3s Time] [2022-01-31 11:47:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-31 11:47:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2022-01-31 11:47:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 122 states have internal predecessors, (152), 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 11:47:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 158 transitions. [2022-01-31 11:47:32,770 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 158 transitions. Word has length 47 [2022-01-31 11:47:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:32,770 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 158 transitions. [2022-01-31 11:47:32,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 158 transitions. [2022-01-31 11:47:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:47:32,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:32,771 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2022-01-31 11:47:32,789 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 11:47:32,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:32,983 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:32,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1797985401, now seen corresponding path program 2 times [2022-01-31 11:47:32,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:32,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837789364] [2022-01-31 11:47:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:32,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:32,993 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391574604] [2022-01-31 11:47:32,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:47:32,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:32,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:32,995 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:33,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 11:47:33,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:47:33,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:33,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:47:33,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:33,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 11:47:33,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:33,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:47:33,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:33,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:47:33,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:47:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:33,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:33,318 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 16 treesize of output 14 [2022-01-31 11:47:33,320 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 28 treesize of output 24 [2022-01-31 11:47:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:33,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:33,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837789364] [2022-01-31 11:47:33,377 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:33,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391574604] [2022-01-31 11:47:33,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391574604] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:33,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:33,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-31 11:47:33,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746025160] [2022-01-31 11:47:33,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:33,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 11:47:33,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 11:47:33,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:47:33,380 INFO L87 Difference]: Start difference. First operand 129 states and 158 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:33,572 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2022-01-31 11:47:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:47:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 47 [2022-01-31 11:47:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:33,573 INFO L225 Difference]: With dead ends: 122 [2022-01-31 11:47:33,573 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 11:47:33,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:47:33,574 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:33,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 213 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 11:47:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2022-01-31 11:47:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 106 states have (on average 1.1886792452830188) internal successors, (126), 106 states have internal predecessors, (126), 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 11:47:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2022-01-31 11:47:33,577 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 47 [2022-01-31 11:47:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:33,578 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2022-01-31 11:47:33,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-01-31 11:47:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:47:33,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:33,578 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:33,601 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 11:47:33,799 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 11:47:33,800 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1182980387, now seen corresponding path program 5 times [2022-01-31 11:47:33,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751638459] [2022-01-31 11:47:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:33,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:33,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:33,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751638459] [2022-01-31 11:47:33,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751638459] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74271383] [2022-01-31 11:47:33,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:47:33,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:33,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:33,944 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 11:47:33,971 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 11:47:34,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:47:34,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:34,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:47:34,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:34,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:34,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74271383] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:34,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:34,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:47:34,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145795412] [2022-01-31 11:47:34,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:34,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:47:34,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:47:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:47:34,337 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:34,735 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-01-31 11:47:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:47:34,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 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 11:47:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:34,736 INFO L225 Difference]: With dead ends: 119 [2022-01-31 11:47:34,736 INFO L226 Difference]: Without dead ends: 119 [2022-01-31 11:47:34,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:47:34,737 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 104 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:34,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 60 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:47:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-31 11:47:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2022-01-31 11:47:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 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 11:47:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-01-31 11:47:34,739 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 49 [2022-01-31 11:47:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:34,740 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-01-31 11:47:34,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-01-31 11:47:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:47:34,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:34,740 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:34,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-01-31 11:47:34,951 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 11:47:34,951 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1207498923, now seen corresponding path program 7 times [2022-01-31 11:47:34,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670396161] [2022-01-31 11:47:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:34,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:34,962 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712562421] [2022-01-31 11:47:34,962 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:47:34,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:34,963 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 11:47:34,982 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 11:47:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:35,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:47:35,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:35,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:47:35,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670396161] [2022-01-31 11:47:35,312 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712562421] [2022-01-31 11:47:35,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712562421] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:35,312 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:35,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:47:35,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908743397] [2022-01-31 11:47:35,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:35,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:47:35,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:47:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:47:35,314 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:35,485 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2022-01-31 11:47:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:47:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:47:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:35,486 INFO L225 Difference]: With dead ends: 97 [2022-01-31 11:47:35,486 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 11:47:35,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-01-31 11:47:35,487 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:35,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:47:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 11:47:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-01-31 11:47:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 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 11:47:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-01-31 11:47:35,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 50 [2022-01-31 11:47:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:35,490 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-01-31 11:47:35,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-01-31 11:47:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:47:35,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:35,490 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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 11:47:35,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:35,695 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 11:47:35,696 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 113363133, now seen corresponding path program 8 times [2022-01-31 11:47:35,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:35,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116028078] [2022-01-31 11:47:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:35,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:35,707 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:35,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298916063] [2022-01-31 11:47:35,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:47:35,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:35,708 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 11:47:35,724 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 11:47:35,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:47:35,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:35,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:47:35,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:35,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:47:35,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:35,977 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 11:47:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,023 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 11:47:36,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:36,069 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 11:47:36,098 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 21 treesize of output 9 [2022-01-31 11:47:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:47:36,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:36,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:47:36,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:47:36,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:47:36,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:47:36,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:36,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 11:47:36,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:36,232 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 40 treesize of output 40 [2022-01-31 11:47:36,235 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 11:47:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-01-31 11:47:36,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116028078] [2022-01-31 11:47:36,369 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298916063] [2022-01-31 11:47:36,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298916063] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:36,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:36,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:47:36,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395105152] [2022-01-31 11:47:36,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:36,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:47:36,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:47:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-01-31 11:47:36,371 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:36,755 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-01-31 11:47:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:47:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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 55 [2022-01-31 11:47:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:36,756 INFO L225 Difference]: With dead ends: 88 [2022-01-31 11:47:36,757 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 11:47:36,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=495, Unknown=4, NotChecked=196, Total=812 [2022-01-31 11:47:36,757 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:36,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 244 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 488 Invalid, 0 Unknown, 340 Unchecked, 0.3s Time] [2022-01-31 11:47:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 11:47:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-01-31 11:47:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 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 11:47:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-01-31 11:47:36,760 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 55 [2022-01-31 11:47:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:36,760 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-01-31 11:47:36,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-01-31 11:47:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:47:36,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:36,761 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2022-01-31 11:47:36,785 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 11:47:36,961 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 11:47:36,962 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1629447202, now seen corresponding path program 9 times [2022-01-31 11:47:36,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:36,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067943714] [2022-01-31 11:47:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:36,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:36,974 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157908652] [2022-01-31 11:47:36,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:47:36,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:36,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:36,976 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 11:47:37,004 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 11:47:37,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:47:37,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:37,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 11:47:37,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:37,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:47:37,248 INFO L353 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2022-01-31 11:47:37,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 34 [2022-01-31 11:47:37,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:37,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-31 11:47:37,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:37,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-31 11:47:37,488 INFO L353 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2022-01-31 11:47:37,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 36 [2022-01-31 11:47:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 11:47:37,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:37,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_~N~0)) (< (+ main_~i~0 2) c_~N~0) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 6))) is different from false [2022-01-31 11:47:38,617 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:38,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 104 [2022-01-31 11:47:38,624 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 83 treesize of output 79 [2022-01-31 11:47:38,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:38,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:38,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 19 [2022-01-31 11:47:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 23 trivial. 13 not checked. [2022-01-31 11:47:38,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067943714] [2022-01-31 11:47:38,701 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157908652] [2022-01-31 11:47:38,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157908652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:38,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:38,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-01-31 11:47:38,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243743084] [2022-01-31 11:47:38,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:38,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:47:38,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:47:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=586, Unknown=7, NotChecked=50, Total=756 [2022-01-31 11:47:38,703 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:39,617 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-01-31 11:47:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:47:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 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 55 [2022-01-31 11:47:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:39,619 INFO L225 Difference]: With dead ends: 103 [2022-01-31 11:47:39,619 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 11:47:39,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=770, Unknown=7, NotChecked=58, Total=992 [2022-01-31 11:47:39,620 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:39,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 212 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2022-01-31 11:47:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 11:47:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-01-31 11:47:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 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 11:47:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-01-31 11:47:39,622 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 55 [2022-01-31 11:47:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:39,623 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-01-31 11:47:39,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 28 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-01-31 11:47:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:47:39,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:39,623 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:39,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-01-31 11:47:39,835 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 11:47:39,835 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash 167504157, now seen corresponding path program 6 times [2022-01-31 11:47:39,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584353808] [2022-01-31 11:47:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:39,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:47:40,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:40,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584353808] [2022-01-31 11:47:40,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584353808] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:40,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140278326] [2022-01-31 11:47:40,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:47:40,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:40,455 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 11:47:40,456 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 11:47:40,563 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:47:40,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:40,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 11:47:40,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:40,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:47:40,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,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 11:47:40,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:40,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:40,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:47:41,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,070 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 11:47:41,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,305 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:47:41,306 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 11:47:41,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:41,678 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:47:41,678 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 76 treesize of output 57 [2022-01-31 11:47:42,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:42,130 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:47:42,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 69 [2022-01-31 11:47:46,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:46,803 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:47:46,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 21 [2022-01-31 11:47:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:47:46,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:37,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_287 Int) (main_~a~0.offset Int) (v_ArrVal_970 (Array Int Int))) (or (not (= 6 (select v_ArrVal_970 (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (not (<= v_main_~i~0_287 0)) (forall ((v_main_~i~0_285 Int) (v_main_~i~0_286 Int) (v_main_~i~0_284 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_970))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_970 (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_286))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_285) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (= (* c_~N~0 6) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 6 .cse4)) (not (= 6 .cse2)) (not (= .cse0 6)) (not (<= v_main_~i~0_285 (+ v_main_~i~0_286 1))) (not (<= v_main_~i~0_284 (+ v_main_~i~0_285 1))) (< (+ v_main_~i~0_284 1) c_~N~0) (not (<= v_main_~i~0_286 (+ v_main_~i~0_287 1))))))))))))) is different from false [2022-01-31 11:48:38,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_287 Int) (v_main_~i~0_285 Int) (v_main_~i~0_286 Int) (v_main_~i~0_284 Int) (main_~a~0.offset Int) (v_ArrVal_970 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_970))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_970 (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_286))))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_285) main_~a~0.offset)))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 6 .cse0)) (= (* c_~N~0 6) (+ .cse1 .cse2 .cse3 .cse0 .cse4)) (not (= 6 .cse4)) (not (= 6 .cse3)) (not (<= v_main_~i~0_287 0)) (not (= .cse1 6)) (not (<= v_main_~i~0_285 (+ v_main_~i~0_286 1))) (not (<= v_main_~i~0_284 (+ v_main_~i~0_285 1))) (< (+ v_main_~i~0_284 1) c_~N~0) (not (<= v_main_~i~0_286 (+ v_main_~i~0_287 1))))))))))) is different from false [2022-01-31 11:48:45,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_287 Int) (v_main_~i~0_285 Int) (v_main_~i~0_286 Int) (v_main_~i~0_284 Int) (main_~a~0.offset Int) (v_ArrVal_970 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_970))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_970 (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_286))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_285) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse2 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 6 .cse0)) (not (= 6 .cse1)) (not (= 6 .cse2)) (not (<= v_main_~i~0_287 0)) (= (* 6 ~N~0) (+ .cse3 .cse4 .cse2 .cse0 .cse1)) (not (= .cse3 6)) (not (<= v_main_~i~0_285 (+ v_main_~i~0_286 1))) (< (+ v_main_~i~0_284 1) ~N~0) (not (<= v_main_~i~0_284 (+ v_main_~i~0_285 1))) (not (<= v_main_~i~0_286 (+ v_main_~i~0_287 1))))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:48:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 6 times theorem prover too weak. 7 trivial. 25 not checked. [2022-01-31 11:48:53,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140278326] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:48:53,010 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:48:53,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 68 [2022-01-31 11:48:53,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958657442] [2022-01-31 11:48:53,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:48:53,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:48:53,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:48:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3771, Unknown=105, NotChecked=384, Total=4556 [2022-01-31 11:48:53,012 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 68 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 65 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:24,561 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2022-01-31 11:49:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-01-31 11:49:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 65 states have internal predecessors, (109), 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 55 [2022-01-31 11:49:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:24,563 INFO L225 Difference]: With dead ends: 213 [2022-01-31 11:49:24,563 INFO L226 Difference]: Without dead ends: 207 [2022-01-31 11:49:24,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 80 SyntacticMatches, 18 SemanticMatches, 124 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4003 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=1250, Invalid=13577, Unknown=191, NotChecked=732, Total=15750 [2022-01-31 11:49:24,566 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 134 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1029 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:24,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 208 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 709 Invalid, 0 Unknown, 1029 Unchecked, 0.6s Time] [2022-01-31 11:49:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-31 11:49:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2022-01-31 11:49:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 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 11:49:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 192 transitions. [2022-01-31 11:49:24,570 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 192 transitions. Word has length 55 [2022-01-31 11:49:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:24,571 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 192 transitions. [2022-01-31 11:49:24,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 65 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:49:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2022-01-31 11:49:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:49:24,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:24,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2022-01-31 11:49:24,591 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 11:49:24,783 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 11:49:24,783 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1076942084, now seen corresponding path program 2 times [2022-01-31 11:49:24,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:24,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077460505] [2022-01-31 11:49:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:24,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:24,793 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:49:24,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868176893] [2022-01-31 11:49:24,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:49:24,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:24,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:24,795 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 11:49:24,799 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 11:49:24,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:49:24,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:24,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 11:49:24,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:24,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:49:24,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:24,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 23 treesize of output 22 [2022-01-31 11:49:25,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:25,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:49:25,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:49:25,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:49:25,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:49:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-31 11:49:25,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:27,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_307 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_307)))) is different from false [2022-01-31 11:49:29,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_308 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_308)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6))))) is different from false [2022-01-31 11:49:31,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_main_~i~0_308 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6) (not (<= (+ c_main_~i~0 1) v_main_~i~0_308)))) is different from false [2022-01-31 11:49:33,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_309 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_309)) (forall ((v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_main_~i~0_308 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) c_main_~a~0.offset) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6) (not (<= (+ v_main_~i~0_309 1) v_main_~i~0_308)))))) is different from false [2022-01-31 11:49:35,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-01-31 11:49:35,504 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:49:35,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2760 treesize of output 2690 [2022-01-31 11:49:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 13 not checked. [2022-01-31 11:49:37,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:49:37,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077460505] [2022-01-31 11:49:37,881 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:49:37,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868176893] [2022-01-31 11:49:37,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868176893] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:49:37,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:49:37,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2022-01-31 11:49:37,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131994285] [2022-01-31 11:49:37,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:49:37,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:49:37,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:49:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:49:37,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=206, Unknown=4, NotChecked=132, Total=420 [2022-01-31 11:49:37,882 INFO L87 Difference]: Start difference. First operand 154 states and 192 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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 11:49:39,905 WARN L838 $PredicateComparison]: unable to prove that (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_309 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_309)) (forall ((v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_main_~i~0_308 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) c_main_~a~0.offset) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6) (not (<= (+ v_main_~i~0_309 1) v_main_~i~0_308))))))) is different from false [2022-01-31 11:49:41,930 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (forall ((v_main_~i~0_308 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_308)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6))))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 6) (forall ((v_main_~i~0_307 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_307)))) (forall ((v_main_~i~0_309 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_309)) (forall ((v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_main_~i~0_308 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) c_main_~a~0.offset) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6) (not (<= (+ v_main_~i~0_309 1) v_main_~i~0_308))))))) is different from false [2022-01-31 11:49:43,955 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (forall ((v_main_~i~0_308 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_308)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6))))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 6) (forall ((v_main_~i~0_307 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_307)))) (forall ((v_main_~i~0_309 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_309)) (forall ((v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_main_~i~0_308 Int) (v_ArrVal_1047 Int) (v_main_~i~0_307 Int)) (or (not (<= (+ v_main_~i~0_308 1) v_main_~i~0_307)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) c_main_~a~0.offset) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_308)) v_ArrVal_1045) (+ c_main_~a~0.offset (* 4 v_main_~i~0_307)) v_ArrVal_1047) c_main_~a~0.offset) 6) (not (<= (+ v_main_~i~0_309 1) v_main_~i~0_308))))))) is different from false [2022-01-31 11:49:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:49:44,046 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-01-31 11:49:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:49:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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 55 [2022-01-31 11:49:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:49:44,048 INFO L225 Difference]: With dead ends: 166 [2022-01-31 11:49:44,048 INFO L226 Difference]: Without dead ends: 166 [2022-01-31 11:49:44,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=94, Invalid=233, Unknown=7, NotChecked=266, Total=600 [2022-01-31 11:49:44,048 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:49:44,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 190 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2022-01-31 11:49:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-31 11:49:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2022-01-31 11:49:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 157 states have internal predecessors, (198), 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 11:49:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2022-01-31 11:49:44,052 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 55 [2022-01-31 11:49:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:49:44,052 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2022-01-31 11:49:44,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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 11:49:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-01-31 11:49:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:49:44,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:49:44,053 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1] [2022-01-31 11:49:44,074 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 11:49:44,267 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 11:49:44,267 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:49:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:49:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1864715515, now seen corresponding path program 3 times [2022-01-31 11:49:44,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:49:44,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603592113] [2022-01-31 11:49:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:49:44,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:49:44,278 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:49:44,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112410824] [2022-01-31 11:49:44,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:49:44,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:49:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:49:44,279 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 11:49:44,292 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 11:49:44,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:49:44,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:49:44,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:49:44,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:49:44,480 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 11:49:44,617 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:49:44,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:49:44,690 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:49:44,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:49:44,759 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:49:44,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-31 11:49:44,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:49:44,930 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 29 treesize of output 29 [2022-01-31 11:49:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:49:45,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:49:46,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (not (<= (+ main_~i~0 1) v_main_~i~0_324)) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)))) is different from false [2022-01-31 11:49:48,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)))) is different from false [2022-01-31 11:49:51,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_327 Int)) (or (forall ((v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1))) (not (<= v_main_~i~0_327 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:49:53,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_main_~i~0_327 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= v_main_~i~0_327 (+ c_main_~i~0 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1113) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)))) is different from false [2022-01-31 11:49:55,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_328 Int)) (or (forall ((v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_main_~i~0_327 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_328)) v_ArrVal_1113) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= v_main_~i~0_327 (+ v_main_~i~0_328 1))) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)))) (not (<= v_main_~i~0_328 0)))) is different from false [2022-01-31 11:50:05,021 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 39 treesize of output 37 [2022-01-31 11:50:05,031 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 440 treesize of output 434 [2022-01-31 11:50:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 20 not checked. [2022-01-31 11:50:05,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603592113] [2022-01-31 11:50:05,685 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:05,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112410824] [2022-01-31 11:50:05,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112410824] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:05,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:05,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2022-01-31 11:50:05,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630161680] [2022-01-31 11:50:05,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:05,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 11:50:05,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 11:50:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=571, Unknown=9, NotChecked=280, Total=1056 [2022-01-31 11:50:05,687 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:27,527 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_314 Int)) (and (<= c_~N~0 (+ v_main_~i~0_314 1)) (<= 3 v_main_~i~0_314) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_314))) 1) (< v_main_~i~0_314 c_~N~0))) (forall ((v_main_~i~0_328 Int)) (or (forall ((v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_main_~i~0_327 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_328)) v_ArrVal_1113) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= v_main_~i~0_327 (+ v_main_~i~0_328 1))) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)))) (not (<= v_main_~i~0_328 0))))) is different from false [2022-01-31 11:50:28,342 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_314 Int)) (and (<= c_~N~0 (+ v_main_~i~0_314 1)) (<= 3 v_main_~i~0_314) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_314))) 1) (< v_main_~i~0_314 c_~N~0))) (<= c_main_~i~0 0) (forall ((v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_main_~i~0_327 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= v_main_~i~0_327 (+ c_main_~i~0 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1113) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324))))) is different from false [2022-01-31 11:50:30,348 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_314 Int)) (and (<= c_~N~0 (+ v_main_~i~0_314 1)) (<= 3 v_main_~i~0_314) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_314))) 1) (< v_main_~i~0_314 c_~N~0))) (<= c_main_~i~0 0) (forall ((v_main_~i~0_327 Int)) (or (forall ((v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1))) (not (<= v_main_~i~0_327 (+ c_main_~i~0 1)))))) is different from false [2022-01-31 11:50:30,834 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (exists ((v_main_~i~0_314 Int)) (and (<= c_~N~0 (+ v_main_~i~0_314 1)) (<= 3 v_main_~i~0_314) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_314))) 1) (< v_main_~i~0_314 c_~N~0))) (forall ((v_ArrVal_1115 Int) (v_main_~i~0_326 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0)) (not (<= (+ v_main_~i~0_326 1) v_main_~i~0_324))))) is different from false [2022-01-31 11:50:31,332 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_314 Int)) (and (<= c_~N~0 (+ v_main_~i~0_314 1)) (<= 3 v_main_~i~0_314) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_314))) 1) (< v_main_~i~0_314 c_~N~0))) (forall ((main_~i~0 Int) (v_ArrVal_1117 Int) (v_main_~i~0_324 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324))) 1) (not (<= (+ main_~i~0 1) v_main_~i~0_324)) (< (+ v_main_~i~0_324 1) c_~N~0) (not (< v_main_~i~0_324 c_~N~0))))) is different from false [2022-01-31 11:50:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:37,748 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2022-01-31 11:50:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 11:50:37,749 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 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 55 [2022-01-31 11:50:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:37,750 INFO L225 Difference]: With dead ends: 169 [2022-01-31 11:50:37,750 INFO L226 Difference]: Without dead ends: 169 [2022-01-31 11:50:37,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=366, Invalid=1131, Unknown=25, NotChecked=830, Total=2352 [2022-01-31 11:50:37,751 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:37,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 219 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 229 Invalid, 0 Unknown, 357 Unchecked, 0.2s Time] [2022-01-31 11:50:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-01-31 11:50:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-01-31 11:50:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 161 states have internal predecessors, (202), 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 11:50:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2022-01-31 11:50:37,755 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 55 [2022-01-31 11:50:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:37,755 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2022-01-31 11:50:37,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2022-01-31 11:50:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:50:37,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:37,756 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 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 11:50:37,778 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 11:50:37,971 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 11:50:37,971 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1160279856, now seen corresponding path program 10 times [2022-01-31 11:50:37,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:37,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885504421] [2022-01-31 11:50:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:37,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:37,982 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:37,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841657094] [2022-01-31 11:50:37,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:50:37,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:37,984 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 11:50:37,994 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 11:50:38,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:50:38,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:38,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:50:38,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:50:38,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:50:38,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:38,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885504421] [2022-01-31 11:50:38,431 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841657094] [2022-01-31 11:50:38,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841657094] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:38,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:38,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:50:38,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992410197] [2022-01-31 11:50:38,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:38,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:50:38,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:50:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:50:38,433 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:38,766 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2022-01-31 11:50:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:50:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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 58 [2022-01-31 11:50:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:38,768 INFO L225 Difference]: With dead ends: 158 [2022-01-31 11:50:38,768 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 11:50:38,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:50:38,768 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 118 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:38,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 126 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:50:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 11:50:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2022-01-31 11:50:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 states have internal predecessors, (105), 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 11:50:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-01-31 11:50:38,771 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 58 [2022-01-31 11:50:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:38,771 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-01-31 11:50:38,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-01-31 11:50:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 11:50:38,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:38,772 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1] [2022-01-31 11:50:38,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:38,979 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 11:50:38,979 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 209925325, now seen corresponding path program 11 times [2022-01-31 11:50:38,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:38,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864448009] [2022-01-31 11:50:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:38,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:38,992 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323844133] [2022-01-31 11:50:38,992 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:50:38,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:38,994 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 11:50:39,001 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 11:50:39,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:50:39,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:39,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:50:39,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:50:39,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:50:39,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:39,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864448009] [2022-01-31 11:50:39,601 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:39,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323844133] [2022-01-31 11:50:39,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323844133] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:39,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:39,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:50:39,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108749481] [2022-01-31 11:50:39,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:39,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:50:39,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:50:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:50:39,603 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:39,950 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-01-31 11:50:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:50:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 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 60 [2022-01-31 11:50:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:39,952 INFO L225 Difference]: With dead ends: 115 [2022-01-31 11:50:39,952 INFO L226 Difference]: Without dead ends: 115 [2022-01-31 11:50:39,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-01-31 11:50:39,953 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 143 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:39,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 123 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:50:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-31 11:50:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2022-01-31 11:50:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 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 11:50:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2022-01-31 11:50:39,955 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 60 [2022-01-31 11:50:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:39,955 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2022-01-31 11:50:39,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-01-31 11:50:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:50:39,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:39,956 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-01-31 11:50:39,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:40,181 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 11:50:40,181 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1580497951, now seen corresponding path program 12 times [2022-01-31 11:50:40,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:40,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542038987] [2022-01-31 11:50:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:40,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:40,192 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:40,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533409219] [2022-01-31 11:50:40,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:50:40,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:40,194 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 11:50:40,220 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 11:50:40,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:50:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 11:50:40,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:40,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:50:40,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:40,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 11:50:40,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:40,775 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 11:50:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:40,828 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 11:50:40,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:40,883 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 11:50:40,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:40,939 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 11:50:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-01-31 11:50:41,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:41,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1334 (Array Int Int))) (or (< (+ main_~i~0 1) c_~N~0) (not (< main_~i~0 c_~N~0)) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1334) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)))))) is different from false [2022-01-31 11:50:41,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:41,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 11:50:41,570 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 11:50:41,570 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 30 [2022-01-31 11:50:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 18 not checked. [2022-01-31 11:50:41,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:41,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542038987] [2022-01-31 11:50:41,649 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:41,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533409219] [2022-01-31 11:50:41,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533409219] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:41,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:41,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-01-31 11:50:41,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215936886] [2022-01-31 11:50:41,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:41,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:50:41,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:41,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:50:41,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=203, Unknown=6, NotChecked=30, Total=306 [2022-01-31 11:50:41,651 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 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 11:50:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:41,853 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-01-31 11:50:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:50:41,853 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 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 63 [2022-01-31 11:50:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:41,854 INFO L225 Difference]: With dead ends: 113 [2022-01-31 11:50:41,854 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 11:50:41,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=269, Unknown=6, NotChecked=36, Total=420 [2022-01-31 11:50:41,855 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:41,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 93 Unchecked, 0.0s Time] [2022-01-31 11:50:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 11:50:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2022-01-31 11:50:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 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 11:50:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-01-31 11:50:41,857 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 63 [2022-01-31 11:50:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:41,858 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-01-31 11:50:41,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 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 11:50:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-01-31 11:50:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:50:41,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:41,858 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 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 11:50:41,880 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 11:50:42,071 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 11:50:42,071 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 971659010, now seen corresponding path program 13 times [2022-01-31 11:50:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:42,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364283419] [2022-01-31 11:50:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:42,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:42,083 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:42,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582863359] [2022-01-31 11:50:42,083 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:50:42,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:42,084 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 11:50:42,099 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 11:50:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:42,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-31 11:50:42,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:42,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:50:42,314 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 37 treesize of output 17 [2022-01-31 11:50:42,372 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:50:42,372 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 27 treesize of output 26 [2022-01-31 11:50:42,428 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 11:50:42,466 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 11:50:42,514 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 11:50:42,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:50:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 11:50:42,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:42,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 6)) is different from false [2022-01-31 11:50:42,643 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 6)) is different from false [2022-01-31 11:50:42,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 6)) is different from false [2022-01-31 11:50:42,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6)) is different from false [2022-01-31 11:50:42,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1413 Int)) (= 6 (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_1413)) |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:50:42,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_412 Int)) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1413 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_412) c_main_~a~0.offset) v_ArrVal_1413)) |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_412)))) is different from false [2022-01-31 11:50:42,793 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:50:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-01-31 11:50:42,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:42,801 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 40 treesize of output 40 [2022-01-31 11:50:42,806 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 11:50:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 35 not checked. [2022-01-31 11:50:42,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364283419] [2022-01-31 11:50:42,893 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582863359] [2022-01-31 11:50:42,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582863359] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:42,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:42,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-01-31 11:50:42,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78178196] [2022-01-31 11:50:42,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:42,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 11:50:42,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 11:50:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=320, Unknown=6, NotChecked=246, Total=650 [2022-01-31 11:50:42,895 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 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 11:50:45,036 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_412 Int)) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1413 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_412) c_main_~a~0.offset) v_ArrVal_1413)) |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_412)))) (= (+ c_main_~i~0 (- 2)) 1) (= (+ (- 5) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) is different from false [2022-01-31 11:50:47,082 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1417 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6) (forall ((v_main_~i~0_412 Int)) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1413 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_412) c_main_~a~0.offset) v_ArrVal_1413)) |c_main_~#sum~0.base| v_ArrVal_1417) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 6)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_412)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) is different from false [2022-01-31 11:50:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:47,341 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions. [2022-01-31 11:50:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:50:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 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 63 [2022-01-31 11:50:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:47,342 INFO L225 Difference]: With dead ends: 163 [2022-01-31 11:50:47,342 INFO L226 Difference]: Without dead ends: 163 [2022-01-31 11:50:47,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=99, Invalid=387, Unknown=8, NotChecked=376, Total=870 [2022-01-31 11:50:47,343 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:47,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 267 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 498 Invalid, 0 Unknown, 350 Unchecked, 0.3s Time] [2022-01-31 11:50:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-31 11:50:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2022-01-31 11:50:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 133 states have internal predecessors, (165), 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 11:50:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2022-01-31 11:50:47,346 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 63 [2022-01-31 11:50:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:47,346 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2022-01-31 11:50:47,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 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 11:50:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2022-01-31 11:50:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:50:47,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:47,347 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 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 11:50:47,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:47,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-31 11:50:47,559 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1526356927, now seen corresponding path program 14 times [2022-01-31 11:50:47,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:47,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048560828] [2022-01-31 11:50:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:47,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:47,582 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:47,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981207091] [2022-01-31 11:50:47,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:50:47,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:47,584 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:47,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-31 11:50:47,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:50:47,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:47,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 11:50:47,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:47,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:50:47,941 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:50:47,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:50:48,000 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:50:48,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:50:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:48,087 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 11:50:48,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:48,138 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 11:50:48,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:50:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-31 11:50:48,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:48,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 6)) is different from false [2022-01-31 11:50:48,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:50:48,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:50:48,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 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_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6)) is different from false [2022-01-31 11:50:48,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_436 Int)) (or (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int)) (= 6 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_436)))) is different from false [2022-01-31 11:50:48,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1495 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int) (v_main_~i~0_436 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1495) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6) (not (<= (+ c_main_~i~0 1) v_main_~i~0_436)))) is different from false [2022-01-31 11:50:48,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_437 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_437)) (forall ((v_ArrVal_1495 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int) (v_main_~i~0_436 Int)) (or (not (<= (+ v_main_~i~0_437 1) v_main_~i~0_436)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_437)) v_ArrVal_1495) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6))))) is different from false [2022-01-31 11:50:48,513 INFO L353 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-01-31 11:50:48,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 55 [2022-01-31 11:50:48,520 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:48,521 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 11:50:48,524 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 11:50:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 35 not checked. [2022-01-31 11:50:48,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048560828] [2022-01-31 11:50:48,691 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:50:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981207091] [2022-01-31 11:50:48,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981207091] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:48,691 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:50:48,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-01-31 11:50:48,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723108715] [2022-01-31 11:50:48,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:48,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 11:50:48,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 11:50:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=420, Unknown=7, NotChecked=336, Total=870 [2022-01-31 11:50:48,693 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:50,825 WARN L838 $PredicateComparison]: unable to prove that (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (= 1 (+ (- 1) c_main_~i~0)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_437 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_437)) (forall ((v_ArrVal_1495 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int) (v_main_~i~0_436 Int)) (or (not (<= (+ v_main_~i~0_437 1) v_main_~i~0_436)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_437)) v_ArrVal_1495) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6)))))) is different from false [2022-01-31 11:50:52,869 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_437 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_437)) (forall ((v_ArrVal_1495 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int) (v_main_~i~0_436 Int)) (or (not (<= (+ v_main_~i~0_437 1) v_main_~i~0_436)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_437)) v_ArrVal_1495) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6))))) (<= 3 c_main_~i~0) (forall ((v_main_~i~0_436 Int)) (or (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int)) (= 6 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_436)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6)) is different from false [2022-01-31 11:50:54,964 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_main_~i~0_437 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_437)) (forall ((v_ArrVal_1495 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int) (v_main_~i~0_436 Int)) (or (not (<= (+ v_main_~i~0_437 1) v_main_~i~0_436)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_437)) v_ArrVal_1495) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6))))) (forall ((v_ArrVal_1499 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (forall ((v_main_~i~0_436 Int)) (or (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1496 Int)) (= 6 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_436) c_main_~a~0.offset) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1499) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_436)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 6)) is different from false [2022-01-31 11:50:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:55,234 INFO L93 Difference]: Finished difference Result 146 states and 172 transitions. [2022-01-31 11:50:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:50:55,235 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:50:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:55,236 INFO L225 Difference]: With dead ends: 146 [2022-01-31 11:50:55,236 INFO L226 Difference]: Without dead ends: 146 [2022-01-31 11:50:55,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=124, Invalid=458, Unknown=10, NotChecked=530, Total=1122 [2022-01-31 11:50:55,236 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:55,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 515 Invalid, 0 Unknown, 332 Unchecked, 0.4s Time] [2022-01-31 11:50:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-31 11:50:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-01-31 11:50:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 133 states have (on average 1.1954887218045114) internal successors, (159), 133 states have internal predecessors, (159), 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 11:50:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2022-01-31 11:50:55,240 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 63 [2022-01-31 11:50:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:55,240 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2022-01-31 11:50:55,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2022-01-31 11:50:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:50:55,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:55,242 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-01-31 11:50:55,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-31 11:50:55,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-31 11:50:55,455 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1020798302, now seen corresponding path program 15 times [2022-01-31 11:50:55,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936112249] [2022-01-31 11:50:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:55,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:55,467 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:50:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799405334] [2022-01-31 11:50:55,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:50:55,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:55,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:55,468 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:55,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-31 11:50:55,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 11:50:55,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:55,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-31 11:50:55,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:55,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:50:56,064 INFO L353 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2022-01-31 11:50:56,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 35 [2022-01-31 11:50:56,119 INFO L353 Elim1Store]: treesize reduction 40, result has 28.6 percent of original size [2022-01-31 11:50:56,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 37 [2022-01-31 11:50:56,284 INFO L353 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2022-01-31 11:50:56,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2022-01-31 11:50:56,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 11:50:56,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:50:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:50:56,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:56,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:50:56,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:50:57,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) is different from false [2022-01-31 11:50:59,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:50:59,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 152 [2022-01-31 11:51:00,154 INFO L353 Elim1Store]: treesize reduction 716, result has 25.3 percent of original size [2022-01-31 11:51:00,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 859 treesize of output 730 [2022-01-31 11:51:00,178 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 200 treesize of output 182 [2022-01-31 11:51:00,197 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 11:51:03,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:03,866 INFO L353 Elim1Store]: treesize reduction 48, result has 65.0 percent of original size [2022-01-31 11:51:03,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 192 treesize of output 252 [2022-01-31 11:51:07,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:51:07,336 INFO L353 Elim1Store]: treesize reduction 25, result has 69.1 percent of original size [2022-01-31 11:51:07,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 316 treesize of output 323 [2022-01-31 11:51:11,693 INFO L353 Elim1Store]: treesize reduction 64, result has 58.2 percent of original size [2022-01-31 11:51:11,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 252 [2022-01-31 11:51:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 32 proven. 35 refuted. 2 times theorem prover too weak. 15 trivial. 11 not checked. [2022-01-31 11:51:14,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:14,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936112249] [2022-01-31 11:51:14,439 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:51:14,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799405334] [2022-01-31 11:51:14,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799405334] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:51:14,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:51:14,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2022-01-31 11:51:14,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945723307] [2022-01-31 11:51:14,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:51:14,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-31 11:51:14,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:51:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-31 11:51:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1588, Unknown=11, NotChecked=258, Total=2162 [2022-01-31 11:51:14,441 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 47 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 47 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:16,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (and (= (+ .cse0 (- 5)) 1) (= 0 (+ (- 1) c_main_~i~0)) (= .cse0 6) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) (= c_main_~i~0 1))) is different from false [2022-01-31 11:51:18,970 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 5)) 1) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0))))) is different from false [2022-01-31 11:51:20,988 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (+ (select .cse0 (+ c_main_~a~0.offset 4)) (- 5)) 1) (= 6 (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) (exists ((main_~i~0 Int)) (let ((.cse1 (* main_~i~0 4))) (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1))) (not (= 4 .cse1))))) (or (<= 2 c_main_~i~0) (<= c_main_~i~0 0)))) is different from false [2022-01-31 11:51:22,995 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 5)) 1) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) (exists ((main_~i~0 Int)) (let ((.cse0 (* main_~i~0 4))) (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse0))) (not (= 4 .cse0)))))) is different from false [2022-01-31 11:51:25,047 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 4))) (.cse2 (* c_main_~i~0 4))) (and (= (+ .cse0 (- 5)) 1) (= 6 (select .cse1 (+ .cse2 c_main_~a~0.offset))) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) (or (= .cse0 6) (= .cse2 4)) (exists ((main_~i~0 Int)) (let ((.cse3 (* main_~i~0 4))) (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse3))) (not (= 4 .cse3))))) (or (<= 2 c_main_~i~0) (<= c_main_~i~0 0)) (exists ((v_main_~i~0_453 Int)) (let ((.cse4 (* 4 v_main_~i~0_453))) (and (not (= .cse4 4)) (or (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse4))) (= (* c_main_~i~0 4) .cse4)))))))) is different from false [2022-01-31 11:51:27,055 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 5)) 1) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (exists ((v_main_~i~0_453 Int)) (let ((.cse0 (* 4 v_main_~i~0_453))) (and (not (= .cse0 4)) (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse2 (= (select .cse1 (+ c_main_~a~0.offset 4)) 6))) (or (and (= 6 (select .cse1 (+ c_main_~a~0.offset .cse0))) (or (and .cse2 (< c_main_~i~0 (+ c_~N~0 1))) (<= c_main_~i~0 2))) (and (<= c_main_~i~0 (+ v_main_~i~0_453 1)) .cse2 (< v_main_~i~0_453 c_~N~0)))))))) (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_~a~0.offset (* main_~i~0 4)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 6)) (not (< main_~i~0 c_~N~0)))) (exists ((main_~i~0 Int)) (let ((.cse3 (* main_~i~0 4))) (and (= 6 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse3))) (not (= 4 .cse3)))))) is different from false [2022-01-31 11:51:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:51:27,400 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2022-01-31 11:51:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 11:51:27,401 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 47 states have internal predecessors, (82), 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 63 [2022-01-31 11:51:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:51:27,401 INFO L225 Difference]: With dead ends: 135 [2022-01-31 11:51:27,401 INFO L226 Difference]: Without dead ends: 135 [2022-01-31 11:51:27,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=472, Invalid=2303, Unknown=17, NotChecked=990, Total=3782 [2022-01-31 11:51:27,403 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:51:27,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 306 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 497 Invalid, 0 Unknown, 330 Unchecked, 0.4s Time] [2022-01-31 11:51:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-01-31 11:51:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-01-31 11:51:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.1935483870967742) internal successors, (148), 124 states have internal predecessors, (148), 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 11:51:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-01-31 11:51:27,406 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 63 [2022-01-31 11:51:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:51:27,406 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-01-31 11:51:27,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 47 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:51:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-01-31 11:51:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:51:27,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:51:27,407 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:51:27,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-01-31 11:51:27,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:27,611 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:51:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:51:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1920859297, now seen corresponding path program 7 times [2022-01-31 11:51:27,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:51:27,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913738746] [2022-01-31 11:51:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:51:27,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:51:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:51:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:51:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:51:28,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:51:28,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913738746] [2022-01-31 11:51:28,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913738746] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:51:28,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761900777] [2022-01-31 11:51:28,519 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:51:28,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:51:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:51:28,520 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:51:28,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-31 11:51:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:51:28,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-31 11:51:28,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:51:28,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:51:28,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:28,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 14 treesize of output 16 [2022-01-31 11:51:28,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:28,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:28,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:28,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,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 11:51:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:51:29,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:29,773 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 11:51:30,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:30,021 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:51:30,021 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 11:51:30,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:30,356 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:51:30,356 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 94 treesize of output 63 [2022-01-31 11:51:30,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:30,788 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:51:30,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 83 [2022-01-31 11:51:31,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:31,274 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:51:31,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 76 [2022-01-31 11:51:31,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:31,927 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:51:31,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 27 [2022-01-31 11:51:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:51:32,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:52:31,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (main_~i~0 Int) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse7 |c_main_~#sum~0.offset|)) (.cse5 (select v_ArrVal_1668 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= 6 .cse0)) (= (* c_~N~0 6) (+ .cse1 .cse2 .cse0 .cse3 .cse4 .cse5)) (not (= 6 .cse4)) (not (= 6 .cse2)) (not (= 6 .cse1)) (not (= 6 .cse5))))))))))) is different from false [2022-01-31 11:52:53,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int) (v_main_~i~0_503 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1668 (+ main_~a~0.offset (* 4 v_main_~i~0_503)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse4 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= .cse2 6)) (not (= 6 .cse3)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse0 .cse2 .cse1 .cse4 .cse3 .cse5))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:52:55,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int) (v_main_~i~0_503 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1668 (+ main_~a~0.offset (* 4 v_main_~i~0_503)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse4 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= .cse2 6)) (not (= 6 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse0 .cse2 .cse1 .cse4 .cse3 .cse5)) (< (+ c_main_~i~0 2) ~N~0)))))))))) is different from false [2022-01-31 11:52:59,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int) (v_main_~i~0_503 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1668 (+ main_~a~0.offset (* 4 v_main_~i~0_503)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse4 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= .cse2 6)) (< (+ c_main_~i~0 3) ~N~0) (not (= 6 .cse3)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse0 .cse2 .cse1 .cse4 .cse3 .cse5))))))))))) is different from false [2022-01-31 11:53:03,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int) (v_main_~i~0_503 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1668 (+ main_~a~0.offset (* 4 v_main_~i~0_503)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse4 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (< (+ c_main_~i~0 4) ~N~0) (not (= .cse2 6)) (not (= 6 .cse3)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse0 .cse2 .cse1 .cse4 .cse3 .cse5))))))))))) is different from false [2022-01-31 11:53:08,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_488 Int) (v_ArrVal_1668 (Array Int Int)) (v_main_~i~0_494 Int) (v_main_~i~0_492 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_490 Int) (v_main_~i~0_503 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1668))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1668 (+ main_~a~0.offset (* 4 v_main_~i~0_503)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_494))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_492))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_490))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse4 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_488))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= .cse2 6)) (< (+ c_main_~i~0 5) ~N~0) (not (= 6 .cse3)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse0 .cse2 .cse1 .cse4 .cse3 .cse5))))))))))) is different from false [2022-01-31 11:53:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 26 trivial. 34 not checked. [2022-01-31 11:53:11,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761900777] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:11,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:11,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 24] total 68 [2022-01-31 11:53:11,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065356761] [2022-01-31 11:53:11,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:11,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:53:11,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:53:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3548, Unknown=32, NotChecked=750, Total=4556 [2022-01-31 11:53:11,724 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:24,745 INFO L93 Difference]: Finished difference Result 263 states and 318 transitions. [2022-01-31 11:53:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 11:53:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 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 63 [2022-01-31 11:53:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:24,747 INFO L225 Difference]: With dead ends: 263 [2022-01-31 11:53:24,747 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 11:53:24,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 105 SyntacticMatches, 15 SemanticMatches, 88 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=536, Invalid=6427, Unknown=33, NotChecked=1014, Total=8010 [2022-01-31 11:53:24,748 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1210 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:24,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1024 Invalid, 0 Unknown, 1210 Unchecked, 0.8s Time] [2022-01-31 11:53:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 11:53:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2022-01-31 11:53:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 227 states have (on average 1.2202643171806167) internal successors, (277), 227 states have internal predecessors, (277), 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 11:53:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 283 transitions. [2022-01-31 11:53:24,752 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 283 transitions. Word has length 63 [2022-01-31 11:53:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:24,753 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 283 transitions. [2022-01-31 11:53:24,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 283 transitions. [2022-01-31 11:53:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:53:24,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:24,754 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:53:24,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:24,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:24,963 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1355197310, now seen corresponding path program 4 times [2022-01-31 11:53:24,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:24,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958185235] [2022-01-31 11:53:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:24,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:24,974 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:53:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577114902] [2022-01-31 11:53:24,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:53:24,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:24,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:24,976 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:53:24,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-31 11:53:25,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:53:25,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:25,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-31 11:53:25,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:25,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 11:53:25,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:25,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:25,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:25,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:25,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:25,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:25,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:25,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:25,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 11:53:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:25,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:25,627 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 16 treesize of output 14 [2022-01-31 11:53:25,629 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 28 treesize of output 24 [2022-01-31 11:53:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:25,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958185235] [2022-01-31 11:53:25,719 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:53:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577114902] [2022-01-31 11:53:25,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577114902] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:25,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:53:25,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-01-31 11:53:25,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316013816] [2022-01-31 11:53:25,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:25,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:53:25,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:53:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2022-01-31 11:53:25,720 INFO L87 Difference]: Start difference. First operand 234 states and 283 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:26,271 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2022-01-31 11:53:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:53:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 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 63 [2022-01-31 11:53:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:26,272 INFO L225 Difference]: With dead ends: 235 [2022-01-31 11:53:26,272 INFO L226 Difference]: Without dead ends: 235 [2022-01-31 11:53:26,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-01-31 11:53:26,273 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:26,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 292 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 11:53:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-31 11:53:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 205. [2022-01-31 11:53:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 198 states have (on average 1.2121212121212122) internal successors, (240), 198 states have internal predecessors, (240), 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 11:53:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2022-01-31 11:53:26,277 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 63 [2022-01-31 11:53:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:26,277 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2022-01-31 11:53:26,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2022-01-31 11:53:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:53:26,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:26,278 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1] [2022-01-31 11:53:26,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:26,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-31 11:53:26,478 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1738500096, now seen corresponding path program 5 times [2022-01-31 11:53:26,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:26,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960819487] [2022-01-31 11:53:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:26,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:26,492 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:53:26,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755709211] [2022-01-31 11:53:26,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:53:26,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:26,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:26,493 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:53:26,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-31 11:53:26,852 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:53:26,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:26,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:53:26,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:26,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 15 treesize of output 11 [2022-01-31 11:53:26,928 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:53:26,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:26,975 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:53:26,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:27,011 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:53:27,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:27,043 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:53:27,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 11:53:27,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 11:53:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-31 11:53:27,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:29,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_555 Int)) (or (forall ((v_ArrVal_1839 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_555)) v_ArrVal_1839) (+ c_main_~a~0.offset 12)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_555)))) is different from false [2022-01-31 11:53:29,346 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 23 treesize of output 21 [2022-01-31 11:53:29,352 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 78 treesize of output 74 [2022-01-31 11:53:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 4 not checked. [2022-01-31 11:53:29,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:29,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960819487] [2022-01-31 11:53:29,420 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:53:29,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755709211] [2022-01-31 11:53:29,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755709211] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:29,420 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:53:29,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 19 [2022-01-31 11:53:29,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202674886] [2022-01-31 11:53:29,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:29,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:53:29,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:53:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2022-01-31 11:53:29,421 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:31,526 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 3) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) (forall ((v_main_~i~0_555 Int)) (or (forall ((v_ArrVal_1839 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_555)) v_ArrVal_1839) (+ c_main_~a~0.offset 12)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_555))))) is different from false [2022-01-31 11:53:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:31,836 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2022-01-31 11:53:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:53:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 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 63 [2022-01-31 11:53:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:31,837 INFO L225 Difference]: With dead ends: 169 [2022-01-31 11:53:31,837 INFO L226 Difference]: Without dead ends: 169 [2022-01-31 11:53:31,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2022-01-31 11:53:31,838 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:31,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 253 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 530 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2022-01-31 11:53:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-01-31 11:53:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-01-31 11:53:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 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 11:53:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2022-01-31 11:53:31,841 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 63 [2022-01-31 11:53:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:31,841 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2022-01-31 11:53:31,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2022-01-31 11:53:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 11:53:31,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:31,842 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:53:31,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:32,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:32,067 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1281288795, now seen corresponding path program 8 times [2022-01-31 11:53:32,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443151849] [2022-01-31 11:53:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:32,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:53:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:53:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:32,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443151849] [2022-01-31 11:53:32,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443151849] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:53:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623771097] [2022-01-31 11:53:32,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:53:32,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:32,316 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:53:32,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-01-31 11:53:32,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:53:32,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:32,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:53:32,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:32,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623771097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:32,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:32,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 11:53:32,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506881847] [2022-01-31 11:53:32,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:32,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:53:32,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:32,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:53:32,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:53:32,924 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:33,889 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2022-01-31 11:53:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:53:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 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 65 [2022-01-31 11:53:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:33,890 INFO L225 Difference]: With dead ends: 211 [2022-01-31 11:53:33,890 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 11:53:33,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 11:53:33,891 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 136 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:33,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 72 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 11:53:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 11:53:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 140. [2022-01-31 11:53:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 133 states have (on average 1.1729323308270676) internal successors, (156), 133 states have internal predecessors, (156), 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 11:53:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2022-01-31 11:53:33,894 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 65 [2022-01-31 11:53:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:33,894 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2022-01-31 11:53:33,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2022-01-31 11:53:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 11:53:33,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:33,895 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:53:33,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:34,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:34,106 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1266250066, now seen corresponding path program 9 times [2022-01-31 11:53:34,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:34,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696020450] [2022-01-31 11:53:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:34,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:53:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:34,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:53:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:34,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696020450] [2022-01-31 11:53:34,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696020450] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:53:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544800713] [2022-01-31 11:53:34,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:53:34,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:34,323 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:53:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-01-31 11:53:34,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 11:53:34,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:34,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:53:34,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:53:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:53:34,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544800713] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:53:34,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:53:34,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 11:53:34,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416434133] [2022-01-31 11:53:34,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:53:34,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:53:34,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:53:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:53:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:53:34,972 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:53:35,439 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2022-01-31 11:53:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:53:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 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 66 [2022-01-31 11:53:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:53:35,440 INFO L225 Difference]: With dead ends: 177 [2022-01-31 11:53:35,440 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 11:53:35,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2022-01-31 11:53:35,441 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 195 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:53:35,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 58 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:53:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 11:53:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2022-01-31 11:53:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 116 states have internal predecessors, (137), 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 11:53:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2022-01-31 11:53:35,444 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 66 [2022-01-31 11:53:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:53:35,444 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2022-01-31 11:53:35,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:53:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-01-31 11:53:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:53:35,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:53:35,444 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1] [2022-01-31 11:53:35,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-31 11:53:35,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-31 11:53:35,645 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:53:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:53:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1794549275, now seen corresponding path program 10 times [2022-01-31 11:53:35,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:53:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540758630] [2022-01-31 11:53:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:53:35,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:53:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:53:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:53:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:53:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 11:53:36,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:53:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540758630] [2022-01-31 11:53:36,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540758630] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:53:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733490531] [2022-01-31 11:53:36,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:53:36,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:53:36,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:53:36,900 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:53:36,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-01-31 11:53:37,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:53:37,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:53:37,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-31 11:53:37,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:53:37,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:53:37,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:37,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:37,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:37,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:37,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:37,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:53:38,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,472 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 11:53:38,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:38,784 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:53:38,784 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 11:53:39,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:39,147 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:53:39,148 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 11:53:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:39,625 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:53:39,625 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 11:53:39,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:39,990 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:53:39,990 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 61 treesize of output 43 [2022-01-31 11:53:40,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:40,425 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:53:40,425 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 98 treesize of output 67 [2022-01-31 11:53:40,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:53:40,884 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:53:40,884 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 11:53:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 11:53:41,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:55:17,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_630 Int) (main_~i~0 Int) (v_ArrVal_2102 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_638 Int) (v_main_~i~0_636 Int) (v_main_~i~0_634 Int) (v_main_~i~0_632 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2102))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2102 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse6 (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| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_638))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_636))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_634))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse1 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_632))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse1 .cse4 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_630))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= 6 .cse2)) (not (= .cse3 6)) (not (= 6 .cse4)) (not (= .cse5 6)) (= (* c_~N~0 6) (+ .cse0 .cse3 .cse5 .cse1 .cse4 .cse2 .cse6)))))))))))) is different from false [2022-01-31 11:58:42,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_630 Int) (v_ArrVal_2102 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_638 Int) (v_main_~i~0_636 Int) (v_main_~i~0_648 Int) (v_main_~i~0_634 Int) (v_main_~i~0_632 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2102))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select v_ArrVal_2102 (+ (* 4 v_main_~i~0_648) main_~a~0.offset))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_638))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_636))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_634))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_632))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_630))))) (or (not (= 6 .cse0)) (not (= .cse1 6)) (not (= 6 .cse2)) (not (= 6 .cse3)) (not (= .cse4 6)) (= (* 6 ~N~0) (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6 .cse0)) (not (= 6 .cse5)))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:59:00,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_630 Int) (~N~0 Int) (v_ArrVal_2102 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_638 Int) (v_main_~i~0_636 Int) (v_main_~i~0_648 Int) (v_main_~i~0_634 Int) (v_main_~i~0_632 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2102))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select v_ArrVal_2102 (+ (* 4 v_main_~i~0_648) main_~a~0.offset))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_638))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_636))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_634))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_632))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_630))))) (or (not (= 6 .cse0)) (not (= .cse1 6)) (not (= 6 .cse2)) (not (= 6 .cse3)) (not (= .cse4 6)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (* 6 ~N~0) (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6 .cse0)) (not (= 6 .cse5)) (< (+ c_main_~i~0 2) ~N~0))))))))))) is different from false [2022-01-31 11:59:42,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_630 Int) (~N~0 Int) (v_ArrVal_2102 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_638 Int) (v_main_~i~0_636 Int) (v_main_~i~0_648 Int) (v_main_~i~0_634 Int) (v_main_~i~0_632 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2102))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select v_ArrVal_2102 (+ (* 4 v_main_~i~0_648) main_~a~0.offset))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_638))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_636))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_634))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_632))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_630))))) (or (not (= 6 .cse0)) (not (= .cse1 6)) (< (+ c_main_~i~0 3) ~N~0) (not (= 6 .cse2)) (not (= 6 .cse3)) (not (= .cse4 6)) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* 6 ~N~0) (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6 .cse0)) (not (= 6 .cse5)))))))))))) is different from false [2022-01-31 12:00:41,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_630 Int) (~N~0 Int) (v_ArrVal_2102 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_638 Int) (v_main_~i~0_636 Int) (v_main_~i~0_648 Int) (v_main_~i~0_634 Int) (v_main_~i~0_632 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2102))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select v_ArrVal_2102 (+ (* 4 v_main_~i~0_648) main_~a~0.offset))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_638))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_636))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_634))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_632))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_630))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 6 .cse0)) (not (= .cse1 6)) (not (= 6 .cse2)) (not (= 6 .cse3)) (not (= .cse4 6)) (not (< (+ c_main_~i~0 3) ~N~0)) (= (* 6 ~N~0) (+ .cse1 .cse4 .cse5 .cse3 .cse2 .cse6 .cse0)) (not (= 6 .cse5)))))))))))) is different from false