/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/condm.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:04:03,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:04:03,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:04:03,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:04:03,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:04:03,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:04:03,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:04:03,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:04:03,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:04:03,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:04:03,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:04:03,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:04:03,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:04:03,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:04:03,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:04:03,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:04:03,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:04:03,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:04:03,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:04:03,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:04:03,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:04:03,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:04:03,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:04:03,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:04:03,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:04:03,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:04:03,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:04:03,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:04:03,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:04:03,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:04:03,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:04:03,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:04:03,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:04:03,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:04:03,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:04:03,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:04:03,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:04:03,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:04:03,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:04:03,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:04:03,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:04:03,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:04:03,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:04:03,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:04:03,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:04:03,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:04:03,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:04:03,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:04:03,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:04:03,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:04:03,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:04:03,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:04:03,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:04:03,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:04:03,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:04:03,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:04:03,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:04:03,418 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:04:03,419 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:04:03,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:04:03,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:04:03,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:04:03,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:04:03,650 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:04:03,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condm.c [2022-01-31 11:04:03,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47547236a/b0f9be8ab7884b71ad57693a3059d4e7/FLAGd8c541304 [2022-01-31 11:04:04,058 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:04:04,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condm.c [2022-01-31 11:04:04,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47547236a/b0f9be8ab7884b71ad57693a3059d4e7/FLAGd8c541304 [2022-01-31 11:04:04,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47547236a/b0f9be8ab7884b71ad57693a3059d4e7 [2022-01-31 11:04:04,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:04:04,091 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:04:04,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:04:04,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:04:04,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:04:04,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb0dc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04, skipping insertion in model container [2022-01-31 11:04:04,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:04:04,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:04:04,289 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/condm.c[588,601] [2022-01-31 11:04:04,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:04:04,310 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:04:04,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/condm.c[588,601] [2022-01-31 11:04:04,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:04:04,340 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:04:04,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04 WrapperNode [2022-01-31 11:04:04,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:04:04,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:04:04,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:04:04,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:04:04,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:04:04,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:04:04,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:04:04,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:04:04,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:04:04,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:04,396 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:04:04,402 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:04:04,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:04:04,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:04:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:04:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:04:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:04:04,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:04:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:04:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:04:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:04:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:04:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:04:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:04:04,468 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:04:04,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:04:04,570 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:04:04,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:04:04,574 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:04:04,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:04:04 BoogieIcfgContainer [2022-01-31 11:04:04,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:04:04,576 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:04:04,576 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:04:04,577 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:04:04,580 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:04:04" (1/1) ... [2022-01-31 11:04:04,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:04:04 BasicIcfg [2022-01-31 11:04:04,593 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:04:04,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:04:04,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:04:04,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:04:04,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:04:04" (1/4) ... [2022-01-31 11:04:04,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ea6190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:04:04, skipping insertion in model container [2022-01-31 11:04:04,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:04:04" (2/4) ... [2022-01-31 11:04:04,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ea6190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:04:04, skipping insertion in model container [2022-01-31 11:04:04,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:04:04" (3/4) ... [2022-01-31 11:04:04,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ea6190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:04:04, skipping insertion in model container [2022-01-31 11:04:04,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:04:04" (4/4) ... [2022-01-31 11:04:04,598 INFO L111 eAbstractionObserver]: Analyzing ICFG condm.cJordan [2022-01-31 11:04:04,602 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:04:04,602 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:04:04,630 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:04:04,635 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:04:04,635 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:04:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 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:04:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 11:04:04,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:04,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:04,649 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 75395733, now seen corresponding path program 1 times [2022-01-31 11:04:04,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044449019] [2022-01-31 11:04:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:04,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:04,798 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:04:04,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:04,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044449019] [2022-01-31 11:04:04,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044449019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:04:04,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:04:04,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:04:04,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621401084] [2022-01-31 11:04:04,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:04:04,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:04:04,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:04:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:04:04,823 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:04:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:04,868 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-01-31 11:04:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:04:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-01-31 11:04:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:04,874 INFO L225 Difference]: With dead ends: 35 [2022-01-31 11:04:04,875 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 11:04:04,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:04:04,878 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:04,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:04:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 11:04:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-31 11:04:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:04:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-01-31 11:04:04,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-01-31 11:04:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:04,902 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-01-31 11:04:04,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:04:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-01-31 11:04:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 11:04:04,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:04,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:04,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:04:04,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2025461737, now seen corresponding path program 1 times [2022-01-31 11:04:04,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:04,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246229401] [2022-01-31 11:04:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:04,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,054 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:04:05,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246229401] [2022-01-31 11:04:05,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246229401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:04:05,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:04:05,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:04:05,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322272376] [2022-01-31 11:04:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:04:05,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:04:05,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:04:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:04:05,060 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:04:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:05,163 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-01-31 11:04:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:04:05,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-31 11:04:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:05,181 INFO L225 Difference]: With dead ends: 39 [2022-01-31 11:04:05,181 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 11:04:05,181 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:04:05,182 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:05,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 31 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:04:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 11:04:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-01-31 11:04:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:04:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-31 11:04:05,193 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2022-01-31 11:04:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:05,196 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-31 11:04:05,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:04:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-31 11:04:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 11:04:05,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:05,197 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] [2022-01-31 11:04:05,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:04:05,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1101033, now seen corresponding path program 1 times [2022-01-31 11:04:05,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:05,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335825365] [2022-01-31 11:04:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:05,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:05,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:05,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335825365] [2022-01-31 11:04:05,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335825365] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:05,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467960262] [2022-01-31 11:04:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:05,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:05,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:05,503 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:04:05,504 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:04:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:05,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 11:04:05,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:05,679 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:04:05,746 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:04:05,823 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:04:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:05,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:06,492 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:04:06,496 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 16 treesize of output 14 [2022-01-31 11:04:06,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 11:04:06,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-01-31 11:04:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:06,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467960262] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:06,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:06,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 23 [2022-01-31 11:04:06,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637898385] [2022-01-31 11:04:06,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:06,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:04:06,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:06,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:04:06,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-01-31 11:04:06,577 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:04:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:07,709 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-01-31 11:04:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 11:04:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-01-31 11:04:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:07,711 INFO L225 Difference]: With dead ends: 85 [2022-01-31 11:04:07,711 INFO L226 Difference]: Without dead ends: 85 [2022-01-31 11:04:07,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=1434, Unknown=0, NotChecked=0, Total=1806 [2022-01-31 11:04:07,713 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 250 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:07,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 88 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:04:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-31 11:04:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2022-01-31 11:04:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.186046511627907) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:04:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-01-31 11:04:07,719 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 27 [2022-01-31 11:04:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:07,719 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-01-31 11:04:07,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:04:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-01-31 11:04:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 11:04:07,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:07,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:07,738 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:04:07,937 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:04:07,938 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 218659731, now seen corresponding path program 1 times [2022-01-31 11:04:07,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:07,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174747443] [2022-01-31 11:04:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:07,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:07,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174747443] [2022-01-31 11:04:07,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174747443] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195462811] [2022-01-31 11:04:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:07,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:08,000 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:04:08,001 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:04:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:08,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:04:08,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:08,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:08,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195462811] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:08,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:08,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:04:08,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127658706] [2022-01-31 11:04:08,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:08,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:04:08,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:04:08,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:04:08,178 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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:04:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:08,309 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-01-31 11:04:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:04:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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 30 [2022-01-31 11:04:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:08,311 INFO L225 Difference]: With dead ends: 78 [2022-01-31 11:04:08,311 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 11:04:08,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:04:08,312 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:08,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:04:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 11:04:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-31 11:04:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:04:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-01-31 11:04:08,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2022-01-31 11:04:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:08,317 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-01-31 11:04:08,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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:04:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-01-31 11:04:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 11:04:08,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:08,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:08,335 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:04:08,535 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:04:08,535 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1587358319, now seen corresponding path program 2 times [2022-01-31 11:04:08,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:08,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028251873] [2022-01-31 11:04:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:08,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:04:08,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028251873] [2022-01-31 11:04:08,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028251873] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888418882] [2022-01-31 11:04:08,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:04:08,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:08,736 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:04:08,737 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:04:08,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:04:08,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:04:08,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-31 11:04:08,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:08,824 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:04:08,863 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 11:04:08,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:08,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:04:08,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:04:08,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-01-31 11:04:09,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:09,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:09,079 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:04:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:04:09,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:11,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_36 Int)) (or (let ((.cse1 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_64 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset))) (or (= (mod .cse0 2) 0) (not (< .cse0 0))))) .cse1) (or (not .cse1) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_64 Int)) (< (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 0))) (forall ((v_ArrVal_64 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 2)) (+ (- 2) (mod c_~N~0 2)))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_36)))) is different from false [2022-01-31 11:04:34,274 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 224 treesize of output 208 [2022-01-31 11:04:34,278 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 262 treesize of output 254 [2022-01-31 11:04:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 11:04:34,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888418882] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:34,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:34,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 28 [2022-01-31 11:04:34,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578494601] [2022-01-31 11:04:34,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:34,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:04:34,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:04:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=587, Unknown=10, NotChecked=50, Total=756 [2022-01-31 11:04:34,365 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:04:36,746 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod c_~N~0 2) 0)) (= c_main_~i~0 0) (forall ((v_main_~i~0_36 Int)) (or (let ((.cse1 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_64 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset))) (or (= (mod .cse0 2) 0) (not (< .cse0 0))))) .cse1) (or (not .cse1) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_64 Int)) (< (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 0))) (forall ((v_ArrVal_64 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 2)) (+ (- 2) (mod c_~N~0 2)))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_36)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (< 0 c_~N~0)) is different from false [2022-01-31 11:04:38,785 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod c_~N~0 2) 0)) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_36 Int)) (or (let ((.cse1 (< c_~N~0 0))) (and (or (forall ((v_ArrVal_64 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset))) (or (= (mod .cse0 2) 0) (not (< .cse0 0))))) .cse1) (or (not .cse1) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_64 Int)) (< (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 0))) (forall ((v_ArrVal_64 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_36 4)) v_ArrVal_64) c_main_~a~0.offset) 2)) (+ (- 2) (mod c_~N~0 2)))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_36)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (< 0 c_~N~0)) is different from false [2022-01-31 11:04:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:39,456 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-01-31 11:04:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 11:04:39,456 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-01-31 11:04:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:39,457 INFO L225 Difference]: With dead ends: 114 [2022-01-31 11:04:39,457 INFO L226 Difference]: Without dead ends: 114 [2022-01-31 11:04:39,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=428, Invalid=2224, Unknown=12, NotChecked=306, Total=2970 [2022-01-31 11:04:39,459 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 237 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:39,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 115 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 593 Invalid, 0 Unknown, 240 Unchecked, 0.4s Time] [2022-01-31 11:04:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-31 11:04:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 60. [2022-01-31 11:04:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:04:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-01-31 11:04:39,464 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 32 [2022-01-31 11:04:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:39,464 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-01-31 11:04:39,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:04:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-01-31 11:04:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 11:04:39,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:39,465 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, 1] [2022-01-31 11:04:39,482 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:04:39,682 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:04:39,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2137660349, now seen corresponding path program 1 times [2022-01-31 11:04:39,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912023714] [2022-01-31 11:04:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:39,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:40,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 11:04:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:40,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912023714] [2022-01-31 11:04:40,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912023714] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163334290] [2022-01-31 11:04:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:40,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:40,289 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:04:40,290 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:04:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:40,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 11:04:40,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:40,377 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:04:40,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:40,425 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 20 [2022-01-31 11:04:40,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:04:40,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:40,513 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:04:40,513 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 3 case distinctions, treesize of input 42 treesize of output 41 [2022-01-31 11:04:40,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:40,589 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:04:40,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-01-31 11:04:40,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:04:40,995 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 1 case distinctions, treesize of input 26 treesize of output 14 [2022-01-31 11:04:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:41,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:43,179 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 318 treesize of output 294 [2022-01-31 11:04:43,191 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-31 11:04:43,192 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 4594 treesize of output 4412 [2022-01-31 11:04:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:43,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163334290] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:43,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:43,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 51 [2022-01-31 11:04:43,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018969764] [2022-01-31 11:04:43,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:43,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-31 11:04:43,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-31 11:04:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2225, Unknown=0, NotChecked=0, Total=2550 [2022-01-31 11:04:43,466 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 47 states have internal predecessors, (83), 8 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-31 11:04:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:55,191 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-01-31 11:04:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-31 11:04:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 47 states have internal predecessors, (83), 8 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 40 [2022-01-31 11:04:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:55,192 INFO L225 Difference]: With dead ends: 103 [2022-01-31 11:04:55,193 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 11:04:55,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=987, Invalid=6842, Unknown=3, NotChecked=0, Total=7832 [2022-01-31 11:04:55,195 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 199 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:55,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 221 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 779 Invalid, 0 Unknown, 105 Unchecked, 0.6s Time] [2022-01-31 11:04:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 11:04:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2022-01-31 11:04:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 67 states have internal predecessors, (74), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 11:04:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-01-31 11:04:55,204 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 40 [2022-01-31 11:04:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:55,204 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-01-31 11:04:55,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 47 states have internal predecessors, (83), 8 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-31 11:04:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-01-31 11:04:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 11:04:55,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:55,206 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:55,229 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:04:55,406 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:04:55,407 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1141507861, now seen corresponding path program 3 times [2022-01-31 11:04:55,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:55,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145056891] [2022-01-31 11:04:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:55,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:55,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:55,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145056891] [2022-01-31 11:04:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145056891] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612628292] [2022-01-31 11:04:55,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:04:55,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:55,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:55,521 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:04:55,522 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:04:55,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:04:55,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:04:55,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:04:55,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:55,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:04:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:55,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612628292] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:04:55,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:04:55,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:04:55,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845199180] [2022-01-31 11:04:55,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:04:55,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:04:55,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:04:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:04:55,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:04:55,781 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:04:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:04:56,108 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2022-01-31 11:04:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:04:56,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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 40 [2022-01-31 11:04:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:04:56,109 INFO L225 Difference]: With dead ends: 164 [2022-01-31 11:04:56,110 INFO L226 Difference]: Without dead ends: 134 [2022-01-31 11:04:56,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-01-31 11:04:56,110 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 139 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:04:56,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 94 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:04:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-01-31 11:04:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2022-01-31 11:04:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 93 states have internal predecessors, (101), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 11:04:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-01-31 11:04:56,118 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 40 [2022-01-31 11:04:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:04:56,118 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-01-31 11:04:56,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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:04:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-01-31 11:04:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:04:56,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:04:56,120 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:04:56,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:04:56,323 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:04:56,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:04:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:04:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1970092857, now seen corresponding path program 4 times [2022-01-31 11:04:56,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:04:56,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769767188] [2022-01-31 11:04:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:04:56,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:04:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:04:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:04:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:04:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:04:56,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:04:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769767188] [2022-01-31 11:04:56,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769767188] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:04:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446312165] [2022-01-31 11:04:56,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:04:56,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:04:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:04:56,653 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:04:56,654 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:04:56,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:04:56,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:04:56,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 11:04:56,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:04:56,746 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:04:56,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:56,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:56,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:56,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:56,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:56,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:56,938 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:04:57,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:57,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 23 treesize of output 22 [2022-01-31 11:04:57,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:57,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:04:57,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:04:57,228 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:04:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:04:57,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:08:45,223 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 388 treesize of output 372 [2022-01-31 11:08:45,238 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 75068 treesize of output 74684 [2022-01-31 11:08:45,418 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 11:08:45,437 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:08:45,621 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:08:45,622 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$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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) 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:08:45,624 INFO L158 Benchmark]: Toolchain (without parser) took 281533.46ms. Allocated memory was 221.2MB in the beginning and 375.4MB in the end (delta: 154.1MB). Free memory was 168.2MB in the beginning and 265.1MB in the end (delta: -96.9MB). Peak memory consumption was 200.6MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,624 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 11:08:45,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.30ms. Allocated memory was 221.2MB in the beginning and 312.5MB in the end (delta: 91.2MB). Free memory was 168.0MB in the beginning and 284.7MB in the end (delta: -116.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,625 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 312.5MB. Free memory was 284.7MB in the beginning and 283.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,625 INFO L158 Benchmark]: RCFGBuilder took 209.59ms. Allocated memory is still 312.5MB. Free memory was 283.1MB in the beginning and 271.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,625 INFO L158 Benchmark]: IcfgTransformer took 16.73ms. Allocated memory is still 312.5MB. Free memory was 271.6MB in the beginning and 270.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,625 INFO L158 Benchmark]: TraceAbstraction took 281029.44ms. Allocated memory was 312.5MB in the beginning and 375.4MB in the end (delta: 62.9MB). Free memory was 270.0MB in the beginning and 265.1MB in the end (delta: 4.8MB). Peak memory consumption was 209.7MB. Max. memory is 8.0GB. [2022-01-31 11:08:45,626 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.10ms. Allocated memory is still 221.2MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.30ms. Allocated memory was 221.2MB in the beginning and 312.5MB in the end (delta: 91.2MB). Free memory was 168.0MB in the beginning and 284.7MB in the end (delta: -116.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 312.5MB. Free memory was 284.7MB in the beginning and 283.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.59ms. Allocated memory is still 312.5MB. Free memory was 283.1MB in the beginning and 271.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.73ms. Allocated memory is still 312.5MB. Free memory was 271.6MB in the beginning and 270.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 281029.44ms. Allocated memory was 312.5MB in the beginning and 375.4MB in the end (delta: 62.9MB). Free memory was 270.0MB in the beginning and 265.1MB in the end (delta: 4.8MB). Peak memory consumption was 209.7MB. 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:08:45,835 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-31 11:08:45,893 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 137 Received shutdown request...