/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/s42if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:44:42,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:44:42,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:44:42,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:44:42,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:44:42,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:44:42,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:44:42,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:44:42,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:44:42,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:44:42,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:44:42,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:44:42,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:44:42,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:44:42,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:44:42,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:44:42,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:44:42,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:44:42,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:44:42,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:44:42,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:44:42,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:44:42,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:44:42,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:44:42,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:44:42,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:44:42,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:44:42,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:44:42,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:44:42,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:44:42,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:44:42,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:44:42,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:44:42,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:44:42,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:44:42,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:44:42,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:44:42,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:44:42,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:44:42,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:44:42,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:44:42,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:44:42,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:44:42,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:44:42,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:44:42,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:44:42,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:44:42,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:44:42,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:44:42,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:44:42,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:44:42,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:44:42,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:44:42,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:44:42,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:44:42,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:44:42,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:44:42,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:44:42,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:44:42,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:44:42,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:44:42,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:44:42,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:44:42,340 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:44:42,340 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:44:42,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:44:42,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:44:42,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:44:42,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:44:42,599 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:44:42,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s42if.c [2022-01-31 11:44:42,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce606e17/01e4cd63faca4cf8a34a28dc2cafea29/FLAGac463e278 [2022-01-31 11:44:43,076 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:44:43,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s42if.c [2022-01-31 11:44:43,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce606e17/01e4cd63faca4cf8a34a28dc2cafea29/FLAGac463e278 [2022-01-31 11:44:43,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce606e17/01e4cd63faca4cf8a34a28dc2cafea29 [2022-01-31 11:44:43,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:44:43,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:44:43,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:44:43,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:44:43,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:44:43,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2cf135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43, skipping insertion in model container [2022-01-31 11:44:43,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:44:43,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:44:43,322 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/s42if.c[588,601] [2022-01-31 11:44:43,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:44:43,359 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:44:43,371 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/s42if.c[588,601] [2022-01-31 11:44:43,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:44:43,403 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:44:43,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43 WrapperNode [2022-01-31 11:44:43,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:44:43,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:44:43,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:44:43,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:44:43,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:44:43,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:44:43,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:44:43,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:44:43,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:44:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:43,484 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:44:43,504 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:44:43,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:44:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:44:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:44:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:44:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:44:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:44:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:44:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:44:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:44:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:44:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:44:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:44:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:44:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:44:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:44:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:44:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:44:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:44:43,607 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:44:43,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:44:43,816 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:44:43,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:44:43,821 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:44:43,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:43 BoogieIcfgContainer [2022-01-31 11:44:43,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:44:43,824 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:44:43,824 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:44:43,828 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:44:43,831 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:43" (1/1) ... [2022-01-31 11:44:43,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:44:43 BasicIcfg [2022-01-31 11:44:43,861 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:44:43,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:44:43,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:44:43,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:44:43,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:44:43" (1/4) ... [2022-01-31 11:44:43,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a4db05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:44:43, skipping insertion in model container [2022-01-31 11:44:43,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:44:43" (2/4) ... [2022-01-31 11:44:43,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a4db05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:44:43, skipping insertion in model container [2022-01-31 11:44:43,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:44:43" (3/4) ... [2022-01-31 11:44:43,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a4db05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:44:43, skipping insertion in model container [2022-01-31 11:44:43,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:44:43" (4/4) ... [2022-01-31 11:44:43,869 INFO L111 eAbstractionObserver]: Analyzing ICFG s42if.cJordan [2022-01-31 11:44:43,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:44:43,874 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:44:43,918 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:44:43,926 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:44:43,927 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:44:43,939 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:44:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:44:43,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:43,947 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:44:43,948 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash 891722992, now seen corresponding path program 1 times [2022-01-31 11:44:43,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470253422] [2022-01-31 11:44:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:43,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,187 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:44:44,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470253422] [2022-01-31 11:44:44,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470253422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:44:44,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:44:44,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:44:44,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041257128] [2022-01-31 11:44:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:44:44,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:44:44,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:44:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:44:44,221 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:44:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:44,282 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-01-31 11:44:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:44:44,284 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:44:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:44,289 INFO L225 Difference]: With dead ends: 36 [2022-01-31 11:44:44,290 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 11:44:44,291 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:44:44,294 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:44,295 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.0s Time] [2022-01-31 11:44:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 11:44:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 11:44:44,317 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:44:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 11:44:44,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-31 11:44:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:44,319 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 11:44:44,319 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:44:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 11:44:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:44:44,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:44,320 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:44:44,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:44:44,320 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1828318323, now seen corresponding path program 1 times [2022-01-31 11:44:44,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:44,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801970159] [2022-01-31 11:44:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:44,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,397 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:44:44,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:44,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801970159] [2022-01-31 11:44:44,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801970159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:44:44,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:44:44,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:44:44,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808703902] [2022-01-31 11:44:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:44:44,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:44:44,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:44:44,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:44:44,401 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:44:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:44,476 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-31 11:44:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:44:44,477 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:44:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:44,478 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:44:44,478 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 11:44:44,478 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:44:44,479 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:44:44,480 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:44:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 11:44:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-31 11:44:44,484 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:44:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 11:44:44,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 11:44:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:44,485 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 11:44:44,485 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:44:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 11:44:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:44:44,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:44,486 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:44:44,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:44:44,488 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash -343654416, now seen corresponding path program 1 times [2022-01-31 11:44:44,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:44,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113620580] [2022-01-31 11:44:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:44,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:44,514 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:44,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407952646] [2022-01-31 11:44:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:44,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:44,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:44,525 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:44:44,533 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:44:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:44:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:44,769 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:44:44,815 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:44:44,832 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:44:44,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:44,900 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 37 treesize of output 31 [2022-01-31 11:44:44,907 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:44:44,908 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:44:44,949 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:44:44,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113620580] [2022-01-31 11:44:44,950 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407952646] [2022-01-31 11:44:44,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407952646] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:44,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:44,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-31 11:44:44,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642130472] [2022-01-31 11:44:44,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:44,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:44:44,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:44:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:44:44,952 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:44:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:45,087 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-01-31 11:44:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:44:45,087 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:44:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:45,088 INFO L225 Difference]: With dead ends: 46 [2022-01-31 11:44:45,088 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 11:44:45,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:44:45,090 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:44:45,090 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:44:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 11:44:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-01-31 11:44:45,094 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:44:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-31 11:44:45,095 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2022-01-31 11:44:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:45,095 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-31 11:44:45,096 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:44:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-31 11:44:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:44:45,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:45,097 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:44:45,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 11:44:45,322 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:44:45,323 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464751, now seen corresponding path program 1 times [2022-01-31 11:44:45,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:45,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988771940] [2022-01-31 11:44:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:45,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:44:45,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:45,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988771940] [2022-01-31 11:44:45,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988771940] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:45,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582567061] [2022-01-31 11:44:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:45,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:45,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:45,754 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:44:45,782 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:44:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:45,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:44:45,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:45,883 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:44:45,891 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:44:45,929 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:44:45,998 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:44:46,112 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:44:46,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-31 11:44:46,275 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:44:46,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:46,407 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 5)) (= (* c_~N~0 5) (+ .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:44:46,578 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:46,579 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:44:46,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:46,584 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:44:46,595 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:44:46,626 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:44:46,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582567061] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:46,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:46,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 12] total 27 [2022-01-31 11:44:46,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088873502] [2022-01-31 11:44:46,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:46,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:44:46,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:44:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=561, Unknown=1, NotChecked=48, Total=702 [2022-01-31 11:44:46,629 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 27 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 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:44:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:47,026 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-31 11:44:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:44:47,027 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 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:44:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:47,029 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:44:47,029 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:44:47,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1004, Unknown=1, NotChecked=66, Total=1260 [2022-01-31 11:44:47,031 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:47,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-01-31 11:44:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:44:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-01-31 11:44:47,036 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:44:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-01-31 11:44:47,037 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2022-01-31 11:44:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:47,037 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-01-31 11:44:47,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 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:44:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-01-31 11:44:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:44:47,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:47,038 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:44:47,065 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:44:47,251 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:44:47,252 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -637057423, now seen corresponding path program 1 times [2022-01-31 11:44:47,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641824084] [2022-01-31 11:44:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:47,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:47,264 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:47,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179160540] [2022-01-31 11:44:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:47,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:47,266 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:44:47,268 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:44:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:47,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:44:47,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:47,360 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:44:47,393 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:44:47,413 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:44:47,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:47,455 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:44:47,460 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:44:47,489 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:44:47,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641824084] [2022-01-31 11:44:47,492 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179160540] [2022-01-31 11:44:47,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179160540] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:47,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:47,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 11:44:47,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63969470] [2022-01-31 11:44:47,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:47,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:44:47,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:44:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:44:47,495 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:44:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:47,576 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-31 11:44:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:44:47,577 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:44:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:47,581 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:44:47,581 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:44:47,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:44:47,583 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:47,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:44:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-01-31 11:44:47,590 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:44:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-01-31 11:44:47,591 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 31 [2022-01-31 11:44:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:47,591 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-01-31 11:44:47,591 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:44:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-01-31 11:44:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:44:47,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:47,592 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:44:47,611 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:44:47,803 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:44:47,804 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash -531940331, now seen corresponding path program 2 times [2022-01-31 11:44:47,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:47,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113929040] [2022-01-31 11:44:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:47,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:47,894 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:44:47,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113929040] [2022-01-31 11:44:47,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113929040] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:47,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113726029] [2022-01-31 11:44:47,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:44:47,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:47,897 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:44:47,921 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:44:47,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:44:47,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:47,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:44:47,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:48,047 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:44:48,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:48,120 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:44:48,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113726029] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:48,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:48,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:44:48,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014399816] [2022-01-31 11:44:48,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:48,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:44:48,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:44:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:44:48,124 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:44:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:48,410 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-01-31 11:44:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:44:48,411 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:44:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:48,411 INFO L225 Difference]: With dead ends: 69 [2022-01-31 11:44:48,412 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 11:44:48,412 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:44:48,412 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:48,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 66 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:44:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 11:44:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-01-31 11:44:48,416 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:44:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 11:44:48,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 33 [2022-01-31 11:44:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:48,417 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 11:44:48,417 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:44:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 11:44:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:44:48,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:48,418 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:44:48,455 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:44:48,630 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:44:48,630 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1196805917, now seen corresponding path program 1 times [2022-01-31 11:44:48,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:48,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304893138] [2022-01-31 11:44:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:48,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:48,642 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143751974] [2022-01-31 11:44:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:48,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:48,644 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:44:48,658 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:44:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:48,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:44:48,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:48,787 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:44:48,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:48,864 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:44:48,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:48,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304893138] [2022-01-31 11:44:48,865 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:48,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143751974] [2022-01-31 11:44:48,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143751974] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:48,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:48,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 11:44:48,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868137324] [2022-01-31 11:44:48,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:48,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:44:48,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:44:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:44:48,867 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:44:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:48,967 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-01-31 11:44:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:44:48,968 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:44:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:48,969 INFO L225 Difference]: With dead ends: 62 [2022-01-31 11:44:48,969 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:44:48,969 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:44:48,970 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:48,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 87 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:44:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:44:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 11:44:48,973 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:44:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-31 11:44:48,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2022-01-31 11:44:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:48,974 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-31 11:44:48,975 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:44:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-31 11:44:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:44:48,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:48,976 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:44:48,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 11:44:49,183 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:44:49,183 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1165711052, now seen corresponding path program 2 times [2022-01-31 11:44:49,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355508793] [2022-01-31 11:44:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:49,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:49,196 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:49,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257949734] [2022-01-31 11:44:49,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:44:49,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:49,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:49,198 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:44:49,208 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:44:49,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:44:49,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:49,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:44:49,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:49,413 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:44:49,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:49,481 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:44:49,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:49,522 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 21 treesize of output 21 [2022-01-31 11:44:49,599 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:44:49,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:49,732 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) (not (<= v_main_~i~0_63 (+ c_main_~i~0 1))) (= 5 (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)))))) is different from false [2022-01-31 11:44:49,869 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:49,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 11:44:49,877 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:49,878 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:44:49,883 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:44:50,185 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:44:50,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:50,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355508793] [2022-01-31 11:44:50,186 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:50,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257949734] [2022-01-31 11:44:50,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257949734] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:50,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:50,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-01-31 11:44:50,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882645623] [2022-01-31 11:44:50,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:50,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:44:50,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:44:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=562, Unknown=7, NotChecked=50, Total=756 [2022-01-31 11:44:50,188 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:44:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:50,544 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-01-31 11:44:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:44:50,545 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:44:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:50,546 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:44:50,546 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:44:50,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=922, Unknown=8, NotChecked=66, Total=1260 [2022-01-31 11:44:50,547 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:50,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 185 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 193 Invalid, 0 Unknown, 193 Unchecked, 0.2s Time] [2022-01-31 11:44:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:44:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-01-31 11:44:50,550 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:44:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-31 11:44:50,551 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2022-01-31 11:44:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:50,552 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-31 11:44:50,552 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:44:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-31 11:44:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:44:50,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:50,553 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:44:50,580 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:44:50,763 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:44:50,764 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1386445909, now seen corresponding path program 3 times [2022-01-31 11:44:50,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:50,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794807109] [2022-01-31 11:44:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:50,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:51,109 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:44:51,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:51,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794807109] [2022-01-31 11:44:51,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794807109] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:51,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484892947] [2022-01-31 11:44:51,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:44:51,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:51,111 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:44:51,116 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:44:51,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:44:51,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:51,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:44:51,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:51,210 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:44:51,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,238 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:44:51,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,252 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:44:51,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,304 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:44:51,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,384 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:44:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,502 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:44:51,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,625 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:51,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 11:44:51,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:51,802 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:51,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-01-31 11:44:51,893 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:44:51,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:52,929 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 ((.cse2 (select .cse4 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= 5 .cse0)) (not (= .cse1 5)) (and (<= (+ c_main_~i~0 1) (div (+ .cse2 .cse1 .cse0) 5)) (<= (div (+ (- 1) .cse2 .cse1 .cse0) 5) c_main_~i~0)))))))) is different from false [2022-01-31 11:44:53,017 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 ((.cse2 (select .cse4 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= 5 .cse0)) (not (= .cse1 5)) (and (<= (+ c_main_~i~0 2) (div (+ .cse2 .cse1 .cse0) 5)) (<= (div (+ (- 1) .cse2 .cse1 .cse0) 5) (+ c_main_~i~0 1))))))))) is different from false [2022-01-31 11:44:53,288 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) 5) 1) (<= 2 (div (+ .cse0 .cse1 .cse2) 5))) (not (= 5 .cse2)) (not (= .cse1 5)))))))) is different from false [2022-01-31 11:44:53,809 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:44:53,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484892947] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:53,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:44:53,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 40 [2022-01-31 11:44:53,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225151621] [2022-01-31 11:44:53,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:53,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-31 11:44:53,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-31 11:44:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1192, Unknown=5, NotChecked=216, Total=1560 [2022-01-31 11:44:53,812 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 40 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 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:44:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:54,957 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2022-01-31 11:44:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 11:44:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 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:44:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:54,959 INFO L225 Difference]: With dead ends: 108 [2022-01-31 11:44:54,959 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 11:44:54,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=321, Invalid=2136, Unknown=5, NotChecked=294, Total=2756 [2022-01-31 11:44:54,961 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 612 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:54,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 186 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 518 Invalid, 0 Unknown, 612 Unchecked, 0.3s Time] [2022-01-31 11:44:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 11:44:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2022-01-31 11:44:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 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:44:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2022-01-31 11:44:54,968 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 39 [2022-01-31 11:44:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:54,968 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2022-01-31 11:44:54,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 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:44:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2022-01-31 11:44:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:44:54,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:54,969 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:44:54,987 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:44:55,175 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:44:55,176 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 821770708, now seen corresponding path program 1 times [2022-01-31 11:44:55,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:55,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713855442] [2022-01-31 11:44:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:55,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:55,188 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782837142] [2022-01-31 11:44:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:55,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:55,190 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:44:55,195 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:44:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:55,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 11:44:55,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:55,331 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:44:55,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:55,380 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:44:55,416 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:44:55,436 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:44:55,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:57,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_90 Int)) (or (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) 5)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)))) is different from false [2022-01-31 11:44:57,554 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:44:57,558 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:44:57,558 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 86 treesize of output 72 [2022-01-31 11:44:57,620 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:44:57,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713855442] [2022-01-31 11:44:57,620 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:57,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782837142] [2022-01-31 11:44:57,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782837142] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:57,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:57,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 11:44:57,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081748248] [2022-01-31 11:44:57,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:57,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:44:57,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:44:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2022-01-31 11:44:57,628 INFO L87 Difference]: Start difference. First operand 77 states and 94 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:44:59,656 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_90 Int)) (or (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) 5)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= (+ (- 4) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1)) is different from false [2022-01-31 11:45:01,665 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (forall ((v_main_~i~0_90 Int)) (or (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) 5)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)))) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 4)) 1)) is different from false [2022-01-31 11:45:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:01,772 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-01-31 11:45:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:45:01,773 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:45:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:01,773 INFO L225 Difference]: With dead ends: 99 [2022-01-31 11:45:01,774 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 11:45:01,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=83, Invalid=232, Unknown=3, NotChecked=102, Total=420 [2022-01-31 11:45:01,774 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:01,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 183 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 85 Unchecked, 0.1s Time] [2022-01-31 11:45:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 11:45:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2022-01-31 11:45:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 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:45:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-01-31 11:45:01,780 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 39 [2022-01-31 11:45:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:01,781 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-01-31 11:45:01,781 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:45:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-01-31 11:45:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:45:01,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:01,782 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:45:01,802 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:45:01,995 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:45:01,996 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1676245229, now seen corresponding path program 1 times [2022-01-31 11:45:01,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959983340] [2022-01-31 11:45:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:01,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:02,018 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:02,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791212357] [2022-01-31 11:45:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:02,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:02,020 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:45:02,030 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:45:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:02,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:45:02,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:02,126 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:45:02,167 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:45:02,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45:02,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 19 treesize of output 7 [2022-01-31 11:45:02,211 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:45:02,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:02,277 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:45:02,280 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:45:02,314 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:45:02,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959983340] [2022-01-31 11:45:02,314 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791212357] [2022-01-31 11:45:02,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791212357] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:02,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:02,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-01-31 11:45:02,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268960525] [2022-01-31 11:45:02,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:02,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 11:45:02,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 11:45:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 11:45:02,317 INFO L87 Difference]: Start difference. First operand 78 states and 97 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:45:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:02,439 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-01-31 11:45:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:45:02,439 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:45:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:02,439 INFO L225 Difference]: With dead ends: 82 [2022-01-31 11:45:02,439 INFO L226 Difference]: Without dead ends: 82 [2022-01-31 11:45:02,440 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:45:02,440 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:02,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-31 11:45:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-01-31 11:45:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 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:45:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2022-01-31 11:45:02,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 39 [2022-01-31 11:45:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:02,444 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2022-01-31 11:45:02,445 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:45:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2022-01-31 11:45:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:45:02,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:02,445 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:45:02,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 11:45:02,655 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:45:02,656 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1211084633, now seen corresponding path program 3 times [2022-01-31 11:45:02,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130896159] [2022-01-31 11:45:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:02,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:02,667 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202598295] [2022-01-31 11:45:02,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:45:02,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:02,669 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:45:02,681 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:45:02,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:45:02,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:02,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:45:02,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:02,880 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:45:02,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:02,961 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:45:02,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130896159] [2022-01-31 11:45:02,961 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202598295] [2022-01-31 11:45:02,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202598295] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:02,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:02,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:45:02,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259147512] [2022-01-31 11:45:02,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:02,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:45:02,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:02,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:45:02,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:45:02,963 INFO L87 Difference]: Start difference. First operand 76 states and 92 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:45:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:03,117 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-01-31 11:45:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:45:03,118 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:45:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:03,118 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:45:03,118 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:45:03,119 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:45:03,119 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:03,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 82 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:45:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-01-31 11:45:03,122 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:45:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-01-31 11:45:03,123 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 42 [2022-01-31 11:45:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:03,123 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-01-31 11:45:03,124 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:45:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-01-31 11:45:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:45:03,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:03,124 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:45:03,151 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:45:03,332 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:45:03,333 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -23692747, now seen corresponding path program 4 times [2022-01-31 11:45:03,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:03,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209210002] [2022-01-31 11:45:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:03,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:03,351 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:03,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116553854] [2022-01-31 11:45:03,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:45:03,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:03,363 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:45:03,364 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:45:03,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:45:03,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:03,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:45:03,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:03,540 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:45:03,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:03,645 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:45:03,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:03,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209210002] [2022-01-31 11:45:03,646 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:03,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116553854] [2022-01-31 11:45:03,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116553854] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:03,646 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:03,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:45:03,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291466537] [2022-01-31 11:45:03,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:03,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:45:03,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:45:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:45:03,647 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:45:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:03,787 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-01-31 11:45:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:45:03,787 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:45:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:03,791 INFO L225 Difference]: With dead ends: 60 [2022-01-31 11:45:03,791 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 11:45:03,793 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:45:03,795 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 85 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:03,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 91 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 11:45:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-01-31 11:45:03,808 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:45:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-01-31 11:45:03,809 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 44 [2022-01-31 11:45:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:03,809 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-01-31 11:45:03,809 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:45:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-01-31 11:45:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:45:03,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:03,810 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:45:03,837 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:45:04,027 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:45:04,027 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 845505913, now seen corresponding path program 5 times [2022-01-31 11:45:04,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195346330] [2022-01-31 11:45:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:04,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:04,046 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:04,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452493978] [2022-01-31 11:45:04,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:45:04,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:04,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:04,052 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:45:04,054 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:45:04,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:45:04,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:04,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:45:04,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:04,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 10 treesize of output 8 [2022-01-31 11:45:04,272 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:45:04,329 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:45:04,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 11:45:04,399 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:45:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:45:04,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:04,461 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)) 5)) is different from false [2022-01-31 11:45:04,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= 5 (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:45:04,482 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)) 5)) is different from false [2022-01-31 11:45:04,520 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:04,521 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:45:04,527 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:04,528 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:45:04,531 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:45:04,623 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:45:04,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:04,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195346330] [2022-01-31 11:45:04,624 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:04,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452493978] [2022-01-31 11:45:04,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452493978] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:04,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:04,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-01-31 11:45:04,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594574248] [2022-01-31 11:45:04,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:04,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:45:04,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:04,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:45:04,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=195, Unknown=3, NotChecked=90, Total=342 [2022-01-31 11:45:04,625 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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:45:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:04,811 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-01-31 11:45:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 11:45:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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 47 [2022-01-31 11:45:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:04,812 INFO L225 Difference]: With dead ends: 75 [2022-01-31 11:45:04,812 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 11:45:04,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=245, Unknown=3, NotChecked=102, Total=420 [2022-01-31 11:45:04,813 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:04,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 186 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-01-31 11:45:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 11:45:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-01-31 11:45:04,816 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:45:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-01-31 11:45:04,817 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 47 [2022-01-31 11:45:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:04,817 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-01-31 11:45:04,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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:45:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-01-31 11:45:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:45:04,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:04,818 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:45:04,837 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:45:05,027 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:45:05,027 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash -897304422, now seen corresponding path program 6 times [2022-01-31 11:45:05,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:05,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306003121] [2022-01-31 11:45:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:05,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:05,039 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:05,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51252178] [2022-01-31 11:45:05,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:45:05,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:05,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:05,041 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:45:05,054 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:45:05,130 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:45:05,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:05,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:45:05,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:05,213 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:45:05,266 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:45:05,266 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:45:05,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:05,323 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:45:05,353 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:45:05,375 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:45:05,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:05,426 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)) 5)) is different from false [2022-01-31 11:45:05,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= 5 (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:45:05,446 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)) 5)) is different from false [2022-01-31 11:45:05,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 5 (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_153)) 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:45:06,760 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:45:06,761 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:45:06,768 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:06,768 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:45:06,772 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:45:06,869 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:45:06,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306003121] [2022-01-31 11:45:06,869 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51252178] [2022-01-31 11:45:06,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51252178] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:06,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:06,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-01-31 11:45:06,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281100612] [2022-01-31 11:45:06,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:06,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:45:06,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:06,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:45:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=275, Unknown=4, NotChecked=148, Total=506 [2022-01-31 11:45:06,871 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:45:08,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 5 (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_153)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= 5 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (= c_main_~i~0 1)) is different from false [2022-01-31 11:45:10,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_153 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_153)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 5 (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_153)) v_ArrVal_534)) |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)) 5) (forall ((v_ArrVal_535 (Array Int Int))) (= 5 (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)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|)) is different from false [2022-01-31 11:45:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:11,126 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2022-01-31 11:45:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:45:11,126 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:45:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:11,127 INFO L225 Difference]: With dead ends: 94 [2022-01-31 11:45:11,127 INFO L226 Difference]: Without dead ends: 94 [2022-01-31 11:45:11,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=106, Invalid=374, Unknown=6, NotChecked=270, Total=756 [2022-01-31 11:45:11,128 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:11,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 197 Unchecked, 0.2s Time] [2022-01-31 11:45:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-31 11:45:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2022-01-31 11:45:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 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:45:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-01-31 11:45:11,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 47 [2022-01-31 11:45:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:11,131 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-01-31 11:45:11,131 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:45:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-01-31 11:45:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:45:11,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:11,132 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:45:11,150 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:45:11,332 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:45:11,333 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 899646937, now seen corresponding path program 4 times [2022-01-31 11:45:11,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:11,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177110049] [2022-01-31 11:45:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:11,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:11,812 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:45:11,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:11,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177110049] [2022-01-31 11:45:11,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177110049] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:11,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749031261] [2022-01-31 11:45:11,813 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:45:11,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:11,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:11,816 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:45:11,817 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:45:11,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:45:11,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:11,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:45:11,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:11,909 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:45:11,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:11,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, 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:45:11,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:11,981 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:45:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,026 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:45:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,158 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:45:12,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,201 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:45:12,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,240 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:45:12,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,321 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:45:12,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,457 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:45:12,457 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:45:12,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,640 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:45:12,641 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 84 treesize of output 57 [2022-01-31 11:45:12,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:12,963 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:45:12,963 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 78 treesize of output 26 [2022-01-31 11:45:13,052 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:45:13,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:18,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (main_~i~0 Int) (v_main_~i~0_167 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset 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 ((.cse2 (select v_ArrVal_593 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_169))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_167))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= .cse2 5)) (= (* c_~N~0 5) (+ .cse2 .cse1 .cse0 .cse3))))))))) is different from false [2022-01-31 11:45:19,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)) (forall ((v_main_~i~0_169 Int) (v_main_~i~0_167 Int) (v_main_~i~0_176 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset 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 (* 4 v_main_~i~0_176)))) (.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_169))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_167))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse0 .cse1 .cse3 .cse2) (* 5 ~N~0))))))))))) is different from false [2022-01-31 11:45:19,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_167 Int) (v_main_~i~0_176 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset 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 (* 4 v_main_~i~0_176)))) (.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_169))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_167))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (+ .cse0 .cse1 .cse3 .cse2) (* 5 ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 11:45:19,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_167 Int) (v_main_~i~0_176 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset 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 (* 4 v_main_~i~0_176)))) (.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_169))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse3 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_167))))) (or (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse0 5)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse0 .cse1 .cse3 .cse2) (* 5 ~N~0))))))))) is different from false [2022-01-31 11:45:19,755 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:45:19,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749031261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:19,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:19,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 48 [2022-01-31 11:45:19,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15802490] [2022-01-31 11:45:19,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:19,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 11:45:19,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 11:45:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1745, Unknown=7, NotChecked=348, Total=2256 [2022-01-31 11:45:19,757 INFO L87 Difference]: Start difference. First operand 77 states and 90 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:45:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:22,211 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2022-01-31 11:45:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-31 11:45:22,212 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:45:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:22,213 INFO L225 Difference]: With dead ends: 189 [2022-01-31 11:45:22,213 INFO L226 Difference]: Without dead ends: 183 [2022-01-31 11:45:22,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=669, Invalid=5660, Unknown=7, NotChecked=636, Total=6972 [2022-01-31 11:45:22,216 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1063 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:22,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 302 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1037 Invalid, 0 Unknown, 1063 Unchecked, 0.6s Time] [2022-01-31 11:45:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-31 11:45:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2022-01-31 11:45:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 131 states have (on average 1.251908396946565) internal successors, (164), 131 states have internal predecessors, (164), 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:45:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-01-31 11:45:22,227 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 47 [2022-01-31 11:45:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:22,227 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-01-31 11:45:22,227 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:45:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-01-31 11:45:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:45:22,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:22,231 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:45:22,254 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:45:22,432 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:45:22,432 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1797985401, now seen corresponding path program 2 times [2022-01-31 11:45:22,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250628873] [2022-01-31 11:45:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:22,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:22,446 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:22,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514163254] [2022-01-31 11:45:22,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:45:22,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:22,448 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:45:22,453 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:45:22,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:45:22,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:22,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:45:22,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:22,565 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:45:22,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:22,602 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:45:22,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:22,629 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:45:22,649 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:45:22,675 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:45:22,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:22,787 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:45:22,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-31 11:45:22,837 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:45:22,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250628873] [2022-01-31 11:45:22,837 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514163254] [2022-01-31 11:45:22,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514163254] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:22,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:22,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-31 11:45:22,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113690200] [2022-01-31 11:45:22,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:22,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 11:45:22,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 11:45:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:45:22,840 INFO L87 Difference]: Start difference. First operand 138 states and 170 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:45:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:23,058 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2022-01-31 11:45:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:45:23,058 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:45:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:23,059 INFO L225 Difference]: With dead ends: 150 [2022-01-31 11:45:23,059 INFO L226 Difference]: Without dead ends: 150 [2022-01-31 11:45:23,059 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:45:23,059 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:23,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 213 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:45:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-01-31 11:45:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2022-01-31 11:45:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 127 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:45:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2022-01-31 11:45:23,063 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 47 [2022-01-31 11:45:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:23,064 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2022-01-31 11:45:23,064 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:45:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2022-01-31 11:45:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:45:23,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:23,064 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:45:23,085 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:45:23,279 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:45:23,279 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1182980387, now seen corresponding path program 5 times [2022-01-31 11:45:23,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:23,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534606757] [2022-01-31 11:45:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:23,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:23,389 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:45:23,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:23,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534606757] [2022-01-31 11:45:23,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534606757] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:23,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304696409] [2022-01-31 11:45:23,390 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:45:23,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:23,391 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:45:23,392 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:45:23,503 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:45:23,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:45:23,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:23,650 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:45:23,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:23,755 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:45:23,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304696409] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:23,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:45:23,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:45:23,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201302558] [2022-01-31 11:45:23,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:23,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:45:23,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:23,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:45:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:45:23,756 INFO L87 Difference]: Start difference. First operand 134 states and 162 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:45:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:24,136 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-01-31 11:45:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:45:24,136 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:45:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:24,137 INFO L225 Difference]: With dead ends: 158 [2022-01-31 11:45:24,137 INFO L226 Difference]: Without dead ends: 158 [2022-01-31 11:45:24,138 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:45:24,138 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:24,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 62 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:45:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-31 11:45:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2022-01-31 11:45:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 120 states have (on average 1.25) internal successors, (150), 120 states have internal predecessors, (150), 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:45:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 156 transitions. [2022-01-31 11:45:24,142 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 156 transitions. Word has length 49 [2022-01-31 11:45:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:24,142 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 156 transitions. [2022-01-31 11:45:24,142 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:45:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 156 transitions. [2022-01-31 11:45:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:45:24,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:24,143 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:45:24,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 11:45:24,351 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:45:24,351 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1207498923, now seen corresponding path program 7 times [2022-01-31 11:45:24,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:24,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451283903] [2022-01-31 11:45:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:24,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:24,365 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:24,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192592830] [2022-01-31 11:45:24,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:45:24,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:24,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:24,367 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:45:24,392 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:45:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:24,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:45:24,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:24,596 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:45:24,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:24,706 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:45:24,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:24,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451283903] [2022-01-31 11:45:24,707 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:24,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192592830] [2022-01-31 11:45:24,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192592830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:24,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:24,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:45:24,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180925262] [2022-01-31 11:45:24,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:24,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:45:24,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:45:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:45:24,708 INFO L87 Difference]: Start difference. First operand 127 states and 156 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:45:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:24,877 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2022-01-31 11:45:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:45:24,877 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:45:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:24,878 INFO L225 Difference]: With dead ends: 97 [2022-01-31 11:45:24,878 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 11:45:24,878 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:45:24,879 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 82 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:24,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 98 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:45:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 11:45:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-01-31 11:45:24,880 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:45:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-01-31 11:45:24,881 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 50 [2022-01-31 11:45:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:24,881 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-01-31 11:45:24,881 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:45:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-01-31 11:45:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:45:24,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:24,882 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:45:24,900 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:45:25,091 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:45:25,092 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash 113363133, now seen corresponding path program 8 times [2022-01-31 11:45:25,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:25,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149105639] [2022-01-31 11:45:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:25,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:25,102 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538471429] [2022-01-31 11:45:25,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:45:25,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:25,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:25,104 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:45:25,107 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:45:25,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:45:25,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:25,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:45:25,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:25,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45:25,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:25,363 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:45:25,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:25,409 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:45:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:25,456 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:45:25,490 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:45:25,511 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:45:25,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:25,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 5 (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:45:25,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 5 (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:45:25,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 5 (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:45:25,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 5 (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:45:25,637 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:25,638 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:45:25,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:25,643 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:45:25,645 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:45:25,775 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:45:25,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149105639] [2022-01-31 11:45:25,776 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538471429] [2022-01-31 11:45:25,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538471429] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:25,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:25,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:45:25,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019323046] [2022-01-31 11:45:25,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:25,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:45:25,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:45:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-01-31 11:45:25,777 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:45:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:26,233 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-01-31 11:45:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:45:26,234 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:45:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:26,235 INFO L225 Difference]: With dead ends: 107 [2022-01-31 11:45:26,235 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 11:45:26,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-01-31 11:45:26,236 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 88 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:26,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 267 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 471 Invalid, 0 Unknown, 333 Unchecked, 0.3s Time] [2022-01-31 11:45:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 11:45:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2022-01-31 11:45:26,238 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:45:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-01-31 11:45:26,238 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 55 [2022-01-31 11:45:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:26,239 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-01-31 11:45:26,239 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:45:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-01-31 11:45:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:45:26,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:26,239 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:45:26,270 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:45:26,451 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:45:26,451 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1629447202, now seen corresponding path program 9 times [2022-01-31 11:45:26,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:26,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753864160] [2022-01-31 11:45:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:26,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:26,463 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:45:26,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049392056] [2022-01-31 11:45:26,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:45:26,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:26,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:26,465 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:45:26,468 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:45:26,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:45:26,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:26,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:45:26,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:26,645 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:45:26,698 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:45:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-01-31 11:45:26,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:26,800 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 21 treesize of output 23 [2022-01-31 11:45:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:26,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-01-31 11:45:26,873 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:45:26,873 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 26 treesize of output 26 [2022-01-31 11:45:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 11:45:26,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:27,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (main_~i~0 Int)) (let ((.cse0 (+ main_~i~0 2))) (or (< .cse0 c_~N~0) (= 5 (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)))) (< c_~N~0 .cse0)))) is different from false [2022-01-31 11:45:27,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (< c_main_~i~0 (+ v_main_~i~0_265 1)) (<= (+ 2 v_main_~i~0_265) c_main_~i~0))) is different from false [2022-01-31 11:45:27,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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 4) v_ArrVal_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (<= (+ v_main_~i~0_265 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_265))) is different from false [2022-01-31 11:45:27,359 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-01-31 11:45:27,359 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 57 treesize of output 46 [2022-01-31 11:45:27,366 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 11:45:27,366 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:45:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 20 not checked. [2022-01-31 11:45:27,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:27,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753864160] [2022-01-31 11:45:27,420 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:45:27,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049392056] [2022-01-31 11:45:27,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049392056] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:45:27,420 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:45:27,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-01-31 11:45:27,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559346317] [2022-01-31 11:45:27,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:45:27,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:45:27,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:45:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:45:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2022-01-31 11:45:27,421 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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:45:28,255 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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 4) v_ArrVal_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (<= (+ v_main_~i~0_265 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_265))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (+ (- 4) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1)) is different from false [2022-01-31 11:45:30,263 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (+ (- 4) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (< c_main_~i~0 (+ v_main_~i~0_265 1)) (<= (+ 2 v_main_~i~0_265) c_main_~i~0)))) is different from false [2022-01-31 11:45:30,901 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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 4) v_ArrVal_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (<= (+ v_main_~i~0_265 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_265))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (< c_main_~i~0 c_~N~0) (= (+ (- 4) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 4) (select .cse0 (+ .cse1 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:45:32,910 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_256 Int)) (and (<= c_main_~i~0 (+ v_main_~i~0_256 1)) (= (+ (- 4) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_256) c_main_~a~0.offset (- 4)))) 1) (< v_main_~i~0_256 c_~N~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (+ (- 4) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_895 Int) (v_main_~i~0_265 Int)) (or (= 5 (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_895)) |c_main_~#sum~0.base| v_ArrVal_898) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)))) (< c_main_~i~0 (+ v_main_~i~0_265 1)) (<= (+ 2 v_main_~i~0_265) c_main_~i~0)))) is different from false [2022-01-31 11:45:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:45:35,000 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-01-31 11:45:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:45:35,001 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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:45:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:45:35,002 INFO L225 Difference]: With dead ends: 103 [2022-01-31 11:45:35,002 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 11:45:35,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=121, Invalid=444, Unknown=15, NotChecked=350, Total=930 [2022-01-31 11:45:35,002 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:45:35,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 170 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 129 Unchecked, 0.0s Time] [2022-01-31 11:45:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 11:45:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-01-31 11:45:35,005 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:45:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-01-31 11:45:35,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 55 [2022-01-31 11:45:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:45:35,006 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-01-31 11:45:35,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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:45:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-01-31 11:45:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:45:35,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:45:35,006 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:45:35,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 11:45:35,219 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:45:35,219 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:45:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:45:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash 167504157, now seen corresponding path program 6 times [2022-01-31 11:45:35,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:45:35,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232051103] [2022-01-31 11:45:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:45:35,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:45:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:45:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:45:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:45:35,817 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:45:35,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:45:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232051103] [2022-01-31 11:45:35,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232051103] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:45:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917930119] [2022-01-31 11:45:35,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:45:35,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:45:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:45:35,824 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:45:35,828 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:45:35,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:45:35,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:45:35,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-31 11:45:35,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:45:35,974 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:45:36,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,024 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:45:36,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,086 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:45:36,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,148 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:45:36,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,212 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:45:36,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,404 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:45:36,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,434 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:45:36,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,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 14 treesize of output 16 [2022-01-31 11:45:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,499 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:45:36,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,592 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:45:36,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,746 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:45:36,746 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:45:36,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:36,937 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:45:36,937 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:45:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:37,130 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:45:37,130 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:45:37,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:45:37,272 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:45:37,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 19 [2022-01-31 11:45:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:45:37,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:03,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_288 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 v_ArrVal_970 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_288))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_286))))) (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 5) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= .cse1 5)) (not (= .cse2 5)) (not (= 5 .cse4)) (not (= .cse0 5)))))))))) is different from false [2022-01-31 11:46:04,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_288 Int) (v_main_~i~0_286 Int) (v_main_~i~0_294 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_294))))) (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_288))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .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 .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (* c_~N~0 5) (+ .cse3 .cse2 .cse4 .cse1 .cse0)) (not (= 5 .cse3)))))))))) is different from false [2022-01-31 11:46:06,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_288 Int) (v_main_~i~0_286 Int) (v_main_~i~0_294 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_294))))) (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_288))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .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 .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse3 .cse2 .cse4 .cse1 .cse0) (* 5 ~N~0)) (not (= 5 .cse3)))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:46:07,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_288 Int) (v_main_~i~0_286 Int) (v_main_~i~0_294 Int) (~N~0 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_294))))) (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_288))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .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 .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse3 .cse2 .cse4 .cse1 .cse0) (* 5 ~N~0)) (not (= 5 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0))))))))) is different from false [2022-01-31 11:46:07,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_288 Int) (v_main_~i~0_286 Int) (v_main_~i~0_294 Int) (~N~0 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_294))))) (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_288))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .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 .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (< (+ c_main_~i~0 3) ~N~0) (not (= 5 .cse2)) (= (+ .cse3 .cse2 .cse4 .cse1 .cse0) (* 5 ~N~0)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 5 .cse3)))))))))) is different from false [2022-01-31 11:46:08,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_288 Int) (v_main_~i~0_286 Int) (v_main_~i~0_294 Int) (~N~0 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_294))))) (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_288))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .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 .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_284))))) (or (not (= 5 .cse0)) (< (+ c_main_~i~0 4) ~N~0) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse3 .cse2 .cse4 .cse1 .cse0) (* 5 ~N~0)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 5 .cse3)))))))))) is different from false [2022-01-31 11:46:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 31 not checked. [2022-01-31 11:46:09,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917930119] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:09,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:46:09,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 60 [2022-01-31 11:46:09,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848016994] [2022-01-31 11:46:09,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:09,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 11:46:09,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:09,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 11:46:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2657, Unknown=19, NotChecked=654, Total=3540 [2022-01-31 11:46:09,330 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 60 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 57 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:46:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:12,990 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2022-01-31 11:46:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 11:46:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 57 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:46:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:12,992 INFO L225 Difference]: With dead ends: 200 [2022-01-31 11:46:12,992 INFO L226 Difference]: Without dead ends: 196 [2022-01-31 11:46:12,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 87 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=584, Invalid=5427, Unknown=19, NotChecked=942, Total=6972 [2022-01-31 11:46:12,994 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 85 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1827 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:12,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 367 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1286 Invalid, 0 Unknown, 1827 Unchecked, 0.8s Time] [2022-01-31 11:46:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-31 11:46:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 175. [2022-01-31 11:46:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 168 states have (on average 1.25) internal successors, (210), 168 states have internal predecessors, (210), 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:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-01-31 11:46:12,999 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 55 [2022-01-31 11:46:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:12,999 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-01-31 11:46:12,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.8793103448275863) internal successors, (109), 57 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:46:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-01-31 11:46:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:46:13,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:13,000 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:46:13,017 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:46:13,203 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:46:13,203 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1076942084, now seen corresponding path program 2 times [2022-01-31 11:46:13,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:13,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278040394] [2022-01-31 11:46:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:13,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:13,218 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:46:13,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182931986] [2022-01-31 11:46:13,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:46:13,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:13,219 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:46:13,220 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:46:13,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:46:13,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:46:13,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 11:46:13,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:46:13,400 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:46:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:13,445 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:46:13,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:13,476 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:46:13,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:46:13,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 25 treesize of output 24 [2022-01-31 11:46:13,542 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:13,567 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:46:13,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:15,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_310 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (+ (- 4) (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_310)))) is different from false [2022-01-31 11:46:17,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int)) (or (forall ((v_main_~i~0_310 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_311)))) is different from false [2022-01-31 11:46:19,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (= (+ (- 4) (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_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_311)))) is different from false [2022-01-31 11:46:21,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_312 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_312)) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (not (<= (+ v_main_~i~0_312 1) v_main_~i~0_311)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312)) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310)))))) is different from false [2022-01-31 11:46:23,976 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 60 treesize of output 54 [2022-01-31 11:46:23,986 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:46:23,986 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 740 treesize of output 718 [2022-01-31 11:46:24,292 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:46:24,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278040394] [2022-01-31 11:46:24,292 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:46:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182931986] [2022-01-31 11:46:24,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182931986] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:24,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:46:24,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2022-01-31 11:46:24,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536388474] [2022-01-31 11:46:24,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:24,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:46:24,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:46:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=206, Unknown=4, NotChecked=132, Total=420 [2022-01-31 11:46:24,294 INFO L87 Difference]: Start difference. First operand 175 states and 216 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:46:26,329 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= (+ (- 4) (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_312 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_312)) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (not (<= (+ v_main_~i~0_312 1) v_main_~i~0_311)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312)) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310))))))) is different from false [2022-01-31 11:46:28,356 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_310 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (+ (- 4) (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_310)))) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_311 Int)) (or (forall ((v_main_~i~0_310 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_311)))) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 4)) 1) (forall ((v_main_~i~0_312 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_312)) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (not (<= (+ v_main_~i~0_312 1) v_main_~i~0_311)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312)) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310))))))) is different from false [2022-01-31 11:46:30,384 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_310 Int)) (or (forall ((v_ArrVal_1047 Int)) (= (+ (- 4) (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_310)))) (forall ((v_main_~i~0_311 Int)) (or (forall ((v_main_~i~0_310 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_311)))) (<= 2 c_main_~i~0) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 4)) 1) (forall ((v_main_~i~0_312 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_312)) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1044 Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int)) (or (not (<= (+ v_main_~i~0_312 1) v_main_~i~0_311)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312)) v_ArrVal_1044) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_1045) (+ (* 4 v_main_~i~0_310) c_main_~a~0.offset) v_ArrVal_1047) c_main_~a~0.offset) (- 4)) 1) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_310))))))) is different from false [2022-01-31 11:46:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:30,460 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-01-31 11:46:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:46:30,460 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:46:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:30,461 INFO L225 Difference]: With dead ends: 187 [2022-01-31 11:46:30,461 INFO L226 Difference]: Without dead ends: 187 [2022-01-31 11:46:30,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=94, Invalid=233, Unknown=7, NotChecked=266, Total=600 [2022-01-31 11:46:30,462 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:30,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 149 Unchecked, 0.1s Time] [2022-01-31 11:46:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-31 11:46:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-01-31 11:46:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.247191011235955) internal successors, (222), 178 states have internal predecessors, (222), 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:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2022-01-31 11:46:30,466 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 55 [2022-01-31 11:46:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:30,466 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2022-01-31 11:46:30,467 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:46:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2022-01-31 11:46:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:46:30,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:30,467 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:46:30,489 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:46:30,668 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:46:30,668 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1864715515, now seen corresponding path program 3 times [2022-01-31 11:46:30,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:30,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787260075] [2022-01-31 11:46:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:30,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:30,679 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:46:30,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002512908] [2022-01-31 11:46:30,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:46:30,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:30,680 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:46:30,685 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:46:30,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:46:30,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:46:30,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 11:46:30,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:46:30,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:46:31,019 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:46:31,020 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:46:31,075 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:46:31,075 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:46:31,115 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:46:31,116 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:46:31,210 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:46:31,210 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:46:31,321 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:46:31,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:32,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1117 Int) (v_main_~i~0_327 Int)) (or (< (+ v_main_~i~0_327 1) c_~N~0) (not (< v_main_~i~0_327 c_~N~0)) (not (<= (+ main_~i~0 1) v_main_~i~0_327)) (= (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_327))) 1))) is different from false [2022-01-31 11:46:34,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1115 Int) (v_main_~i~0_329 Int) (v_ArrVal_1117 Int) (v_main_~i~0_327 Int)) (or (not (<= (+ v_main_~i~0_329 1) v_main_~i~0_327)) (< (+ v_main_~i~0_327 1) c_~N~0) (not (< v_main_~i~0_327 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_329)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327))) 1))) is different from false [2022-01-31 11:46:36,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_330 Int)) (or (forall ((v_ArrVal_1115 Int) (v_main_~i~0_329 Int) (v_ArrVal_1117 Int) (v_main_~i~0_327 Int)) (or (not (<= (+ v_main_~i~0_329 1) v_main_~i~0_327)) (< (+ v_main_~i~0_327 1) c_~N~0) (not (< v_main_~i~0_327 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_330)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_329)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327))) 1))) (not (<= v_main_~i~0_330 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:46:38,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_330 Int) (v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_329 Int) (v_ArrVal_1117 Int) (v_main_~i~0_327 Int)) (or (not (<= (+ v_main_~i~0_329 1) v_main_~i~0_327)) (< (+ v_main_~i~0_327 1) c_~N~0) (not (< v_main_~i~0_327 c_~N~0)) (= (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_330)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_329)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327))) 1) (not (<= v_main_~i~0_330 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:46:39,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_330 Int) (v_ArrVal_1113 Int) (v_ArrVal_1115 Int) (v_main_~i~0_329 Int) (v_ArrVal_1117 Int) (v_main_~i~0_327 Int)) (or (not (<= (+ v_main_~i~0_329 1) v_main_~i~0_327)) (< (+ v_main_~i~0_327 1) c_~N~0) (not (< v_main_~i~0_327 c_~N~0)) (not (<= v_main_~i~0_330 1)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset v_ArrVal_1113) (+ c_main_~a~0.offset (* 4 v_main_~i~0_330)) v_ArrVal_1115) (+ c_main_~a~0.offset (* 4 v_main_~i~0_329)) v_ArrVal_1117) (+ c_main_~a~0.offset (* 4 v_main_~i~0_327))) 1))) is different from false [2022-01-31 11:46:47,709 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 35 treesize of output 33 [2022-01-31 11:46:47,713 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 3190 treesize of output 3142 [2022-01-31 11:46:47,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787260075] [2022-01-31 11:46:47,961 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:46:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002512908] [2022-01-31 11:46:47,962 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:46:47,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-01-31 11:46:48,162 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:46:48,162 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-31 11:46:48,167 INFO L158 Benchmark]: Toolchain (without parser) took 125062.03ms. Allocated memory was 204.5MB in the beginning and 318.8MB in the end (delta: 114.3MB). Free memory was 150.8MB in the beginning and 255.1MB in the end (delta: -104.3MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,167 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:46:48,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.74ms. Allocated memory was 204.5MB in the beginning and 265.3MB in the end (delta: 60.8MB). Free memory was 150.5MB in the beginning and 237.4MB in the end (delta: -86.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,167 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 265.3MB. Free memory was 237.4MB in the beginning and 235.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,167 INFO L158 Benchmark]: RCFGBuilder took 372.31ms. Allocated memory is still 265.3MB. Free memory was 235.3MB in the beginning and 222.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,167 INFO L158 Benchmark]: IcfgTransformer took 37.27ms. Allocated memory is still 265.3MB. Free memory was 222.7MB in the beginning and 221.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,168 INFO L158 Benchmark]: TraceAbstraction took 124303.61ms. Allocated memory was 265.3MB in the beginning and 318.8MB in the end (delta: 53.5MB). Free memory was 220.6MB in the beginning and 255.1MB in the end (delta: -34.5MB). Peak memory consumption was 174.0MB. Max. memory is 8.0GB. [2022-01-31 11:46:48,170 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 204.5MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.74ms. Allocated memory was 204.5MB in the beginning and 265.3MB in the end (delta: 60.8MB). Free memory was 150.5MB in the beginning and 237.4MB in the end (delta: -86.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 265.3MB. Free memory was 237.4MB in the beginning and 235.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.31ms. Allocated memory is still 265.3MB. Free memory was 235.3MB in the beginning and 222.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 37.27ms. Allocated memory is still 265.3MB. Free memory was 222.7MB in the beginning and 221.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 124303.61ms. Allocated memory was 265.3MB in the beginning and 318.8MB in the end (delta: 53.5MB). Free memory was 220.6MB in the beginning and 255.1MB in the end (delta: -34.5MB). Peak memory consumption was 174.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 11:46:48,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...